Skip to main content
SpringerLink
Log in

Algorithms - ESA 2007

15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Lars Arge
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michael Hoffmann
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Emo Welzl
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4698)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: ESA 2007.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (66 papers)

  1. Contributed Papers: Design and Analysis Track

    1. k-Anonymization with Minimal Loss of Information

      • Aristides Gionis, Tamir Tassa
      Pages 439-450

    2. A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs

      • Khaled Elbassioni, René Sitters, Yan Zhang
      Pages 451-462

    3. Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling

      • Koji Kobayashi, Kazuya Okamoto
      Pages 463-474

    4. Bundle Pricing with Comparable Items

      • Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld
      Pages 475-486

    5. Approximating Interval Scheduling Problems with Bounded Profits

      • Israel Beniaminy, Zeev Nutov, Meir Ovadia
      Pages 487-497

    6. Pricing Tree Access Networks with Connected Backbones

      • Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi
      Pages 498-509

    7. Distance Coloring

      • Alexa Sharp
      Pages 510-521

    8. An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching

      • Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph (Seffi) Naor
      Pages 522-533

    9. To Fill or Not to Fill: The Gas Station Problem

      • Samir Khuller, Azarakhsh Malekian, Julián Mestre
      Pages 534-545

    10. Online Bandwidth Allocation

      • Michal Forišek, Branislav Katreniak, Jana Katreniaková, Rastislav Královič, Richard Královič, Vladimír Koutný et al.
      Pages 546-557

    11. Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems

      • Chien-Chung Huang
      Pages 558-569

    12. On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems

      • Amos Israeli, Dror Rawitz, Oran Sharon
      Pages 570-581

    13. Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs

      • Cyril Gavoille, Arnaud Labourel
      Pages 582-593

    14. Dynamic Plane Transitive Closure

      • Krzysztof Diks, Piotr Sankowski
      Pages 594-604

  2. Contributed Papers: Engineering and Applications Track

    1. Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments

      • Giorgio Ausiello, Camil Demetrescu, Paolo G. Franciosa, Giuseppe F. Italiano, Andrea Ribichini
      Pages 605-617

    2. Estimating Clustering Indexes in Data Streams

      • Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler
      Pages 618-632

    3. Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

      • Laurent Dupont, Michael Hemmer, Sylvain Petitjean, Elmar Schömer
      Pages 633-644

    4. Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step

      • Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
      Pages 645-656

    5. Fast and Compact Oracles for Approximate Distances in Planar Graphs

      • Laurent Flindt Muller, Martin Zachariasen
      Pages 657-668

    6. Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces

      • Peter Hachenberger
      Pages 669-680
Back to top

Other volumes

  1. Algorithms – ESA 2007

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation