Skip to main content
SpringerLink
Log in

Algorithms –- ESA 2012

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

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Leah Epstein

    1. Department of Mathematics, University of Haifa, Haifa, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Paolo Ferragina

    1. Dipartimento di Informatica, Università di Pisa, Pisa, Italy

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

Included in the following conference series:

Conference proceedings info: ESA 2012.

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 (71 papers)

  1. Front Matter

    Download chapter PDF

  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
Back to top

Other volumes

  1. Algorithms – ESA 2012

Keywords

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.

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

Publish with us

Policies and ethics

Back to top

Search

Navigation