Skip to main content
  • Conference proceedings
  • © 2010

Algorithms - ESA 2010

18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings

  • up-to-date results

  • fast track conference proceedings

  • state-of-the-art report

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

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

Conference series link(s): ESA: European Symposium on Algorithms

Conference proceedings info: ESA 2010.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (49 papers)

  1. Front Matter

  2. Invited Talk

    1. The Robustness of Level Sets

      • Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit Patel
      Pages 1-10
  3. Session 1a

    1. Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods

      • Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella et al.
      Pages 11-22
    2. Non-clairvoyant Speed Scaling for Weighted Flow Time

      • Sze-Hang Chan, Tak-Wah Lam, Lap-Kei Lee
      Pages 23-35
    3. A Robust PTAS for Machine Covering and Packing

      • Martin Skutella, José Verschae
      Pages 36-47
  4. Session 1b

    1. Balancing Degree, Diameter and Weight in Euclidean Spanners

      • Shay Solomon, Michael Elkin
      Pages 48-59
    2. Testing Euclidean Spanners

      • Frank Hellweg, Melanie Schmidt, Christian Sohler
      Pages 60-71
    3. Fast Approximation in Subspaces by Doubling Metric Decomposition

      • Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
      Pages 72-83
    4. f-Sensitivity Distance Oracles and Routing Schemes

      • Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
      Pages 84-96
  5. Session 2a

    1. Fast Minor Testing in Planar Graphs

      • Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
      Pages 97-109
    2. On the Number of Spanning Trees a Planar Graph Can Have

      • Kevin Buchin, André Schulz
      Pages 110-121
    3. Contractions of Planar Graphs in Polynomial Time

      • Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos
      Pages 122-133
  6. Session 2b

    1. Communication Complexity of Quasirandom Rumor Spreading

      • Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
      Pages 134-145
    2. A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing

      • Emmanouil Pountourakis, Angelina Vidali
      Pages 146-157
    3. Contribution Games in Social Networks

      • Elliot Anshelevich, Martin Hoefer
      Pages 158-169
  7. Session 3a

    1. Improved Bounds for Online Stochastic Matching

      • Bahman Bahmani, Michael Kapralov
      Pages 170-181
    2. Online Stochastic Packing Applied to Display Ad Allocation

      • Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Cliff Stein
      Pages 182-194
    3. Caching Is Hard – Even in the Fault Model

      • Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu
      Pages 195-206
  8. Session 3b

    1. Superselectors: Efficient Constructions and Applications

      • Ferdinando Cicalese, Ugo Vaccaro
      Pages 207-218

Other Volumes

  1. Algorithms – ESA 2010

Keywords

  • CSP
  • Huffman
  • Partition
  • Permutation
  • Routing
  • Scheduling
  • algorithmic aspects
  • algorithms
  • complexity
  • data structures
  • graph algorithms
  • planar graphs
  • real-time scheduling
  • sorting
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Department of Mathematics and Computing Science, TU Eindhoven, Eindhoven, The Netherlands

    Mark Berg

  • Institute for Computer Science, J.W. Goethe University, Frankfurt/Main, Germany

    Ulrich Meyer

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions