Skip to main content
  • Conference proceedings
  • © 2012

Algorithms –- ESA 2012

20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings

Editors:

(view affiliations)
  • Up to date results

  • Fast track conference proceedings

  • State of the art research

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

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 2012.

Buying options

eBook
USD 89.00
Price excludes VAT (USA)
  • ISBN: 978-3-642-33090-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 119.99
Price excludes VAT (USA)

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

Table of contents (71 papers)

  1. Front Matter

  2. On Big Data Algorithmics

    • Yossi Matias
    Pages 1-1
  3. Open Problems in Throughput Scheduling

    • Jiří Sgall
    Pages 2-11
  4. Preemptive Coordination Mechanisms for Unrelated Machines

    • Fidaa Abed, Chien-Chung Huang
    Pages 12-23
  5. Hierarchical Hub Labelings for Shortest Paths

    • Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
    Pages 24-35
  6. Bottleneck Non-crossing Matching in the Plane

    • A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
    Pages 36-47
  7. Lower Bounds for Sorted Geometric Queries in the I/O Model

    • Peyman Afshani, Norbert Zeh
    Pages 48-59
  8. Constructing Street Networks from GPS Trajectories

    • Mahmuda Ahmed, Carola Wenk
    Pages 60-71
  9. I/O-efficient Hierarchical Diameter Approximation

    • Deepak Ajwani, Ulrich Meyer, David Veith
    Pages 72-83
  10. On the Value of Job Migration in Online Makespan Minimization

    • Susanne Albers, Matthias Hellwig
    Pages 84-95
  11. Simplifying Massive Contour Maps

    • Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen
    Pages 96-107
  12. Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash

    • Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
    Pages 108-120
  13. On Online Labeling with Polynomially Many Labels

    • Martin Babka, Jan Bulánek, Vladimír Čunát, Michal Koucký, Michael Saks
    Pages 121-132
  14. A 5-Approximation for Capacitated Facility Location

    • Manisha Bansal, Naveen Garg, Neelima Gupta
    Pages 133-144
  15. Weighted Geometric Set Multi-cover via Quasi-uniform Sampling

    • Nikhil Bansal, Kirk Pruhs
    Pages 145-156
  16. A Bicriteria Approximation for the Reordering Buffer Problem

    • Siddharth Barman, Shuchi Chawla, Seeun Umboh
    Pages 157-168
  17. Time-Dependent Route Planning with Generalized Objective Functions

    • Gernot Veit Batz, Peter Sanders
    Pages 169-180
  18. New Lower and Upper Bounds for Representing Sequences

    • Djamal Belazzougui, Gonzalo Navarro
    Pages 181-192
  19. Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection

    • Aleksandrs Belovs, Ben W. Reichardt
    Pages 193-204
  20. The Stretch Factor of L 1- and L  ∞ -Delaunay Triangulations

    • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perković
    Pages 205-216

Other Volumes

  1. Algorithms – ESA 2012

    20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings

About this book

This book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching, quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.

Keywords

  • anonymous network
  • linear programming
  • network design
  • online algorithms
  • symmetric multicast
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • Department of Mathematics, University of Haifa, Haifa, Israel

    Leah Epstein

  • Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    Paolo Ferragina

Bibliographic Information

Buying options

eBook
USD 89.00
Price excludes VAT (USA)
  • ISBN: 978-3-642-33090-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 119.99
Price excludes VAT (USA)