Skip to main content
SpringerLink
Log in
Book cover

Algorithms -- ESA 2010, Part II

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

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Mark Berg

    1. Department of Mathematics and Computing Science, TU Eindhoven, Eindhoven, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ulrich Meyer

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 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 6347)

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

Included in the following conference series:

Conference proceedings info: ESA 2010.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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 (20 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talk

    1. Data Structures: Time, I/Os, Entropy, Joules!

      • Paolo Ferragina
      Pages 1-16

  3. Session 8a

    1. Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness

      • Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
      Pages 17-28

    2. Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

      • Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
      Pages 29-38

    3. Combinatorial Auctions with Verification Are Tractable

      • Piotr Krysta, Carmine Ventre
      Pages 39-50

    4. How to Allocate Goods in an Online Market?

      • Yossi Azar, Niv Buchbinder, Kamal Jain
      Pages 51-62

  4. Session 8b

    1. Fréchet Distance of Surfaces: Some Simple Hard Cases

      • Kevin Buchin, Maike Buchin, André Schulz
      Pages 63-74

    2. Geometric Algorithms for Private-Cache Chip Multiprocessors

      • Deepak Ajwani, Nodari Sitchinava, Norbert Zeh
      Pages 75-86

    3. Volume in General Metric Spaces

      • Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman
      Pages 87-99

    4. Shortest Cut Graph of a Surface with Prescribed Vertex Set

      • Éric Colin de Verdière
      Pages 100-111

  5. Session 9a

    1. Induced Matchings in Subcubic Planar Graphs

      • Ross J. Kang, Matthias Mnich, Tobias Müller
      Pages 112-122

    2. Robust Matchings and Matroid Intersections

      • Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino
      Pages 123-134

    3. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties

      • Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
      Pages 135-146

    4. Strongly Stable Assignment

      • Ning Chen, Arpita Ghosh
      Pages 147-158

  6. Session 9b

    1. Data Structures for Storing Small Sets in the Bitprobe Model

      • Jaikumar Radhakrishnan, Smit Shah, Saswata Shannigrahi
      Pages 159-170

    2. On Space Efficient Two Dimensional Range Minimum Data Structures

      • Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
      Pages 171-182

    3. Pairing Heaps with Costless Meld

      • Amr Elmasry
      Pages 183-193

    4. Top-k Ranked Document Search in General Text Databases

      • J. Shane Culpepper, Gonzalo Navarro, Simon J. Puglisi, Andrew Turpin
      Pages 194-205

  7. Best-Paper Session

    1. Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time

      • Shay Mozes, Christian Wulff-Nilsen
      Pages 206-217

    2. When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

      • Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra
      Pages 218-229
Back to top

Other volumes

  1. Algorithms – ESA 2010

  2. Algorithms – ESA 2010

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation