Skip to main content
SpringerLink
Log in

Algorithms - ESA 2002

10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings

  • Conference proceedings
  • © 2002

Overview

Editors:
  1. Rolf Möhring

    1. Fakultät II: Mathematik und Naturwissenschaften, Technische Universität Berlin, Berlin, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Rajeev Raman

    1. Department of Mathematics and Computer Science, University of Leicester, Leicester, UK

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

Included in the following conference series:

Conference proceedings info: ESA 2002.

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

  1. Front Matter

    Pages I-XIV
    Download chapter PDF

  2. Invited Lectures

    1. Solving Traveling Salesman Problems

      • William Cook
      Pages 1-1

    2. Computing Shapes from Point Cloud Data

      • Tamal K. Dey
      Pages 2-2

    3. Mechanism Design for Fun and Profit

      • Anna R. Karlin
      Pages 3-3

    4. On Distance Oracles and Routing in Graphs

      • Mikkel Thorup
      Pages 4-4

  3. Contributed Papers

    1. Kinetic Medians and kd-Trees

      • Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas
      Pages 5-17

    2. Range Searching in Categorical Data: Colored Range Searching on Grid

      • Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan
      Pages 17-28

    3. Near-Linear Time Approximation Algorithms for Curve Simplification

      • Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
      Pages 29-41

    4. Translating a Planar Object to Maximize Point Containment

      • Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel Smid, Emo Welzl
      Pages 42-53

    5. Approximation Algorithms for k-Line Center

      • Pankaj K. Agarwal, Cecilia M. Procopiuc, Kasturi R. Varadarajan
      Pages 54-63

    6. New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman Problem

      • Dino Ahr, Gerhard Reinelt
      Pages 64-74

    7. SCIL — Symbolic Constraints in Integer Linear Programming

      • Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
      Pages 75-87

    8. Implementing I/O-efficient Data Structures Using TPIE

      • Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
      Pages 88-100

    9. On the k-Splittable Flow Problem

      • Georg Baier, Ekkehard Köhler, Martin Skutella
      Pages 101-113

    10. Partial Alphabetic Trees

      • Arye Barkan, Haim Kaplan
      Pages 114-125

    11. Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router

      • Chris Barrett, Keith Bisset, Riko Jacob, Goran Konjevod, Madhav Marathe
      Pages 126-138

    12. Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy

      • Michael A. Bender, Richard Cole, Erik D. Demaine, 4Martin Farach-Colton
      Pages 139-150

    13. Two Simplified Algorithms for Maintaining Order in a List

      • Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito
      Pages 152-164

    14. Efficient Tree Layout in a Multilevel Memory Hierarchy

      • Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
      Pages 165-173

    15. A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons

      • Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer
      Pages 174-186
Back to top

Other volumes

  1. Algorithms — ESA 2002

Keywords

About this book

This volume contains the 74 contributed papers and abstracts of 4 of the 5 invited talks presented at the 10th Annual European Symposium on Algorithms (ESA 2002), held at the University of Rome “La Sapienza”, Rome, Italy, 17-21 September, 2002. For the ?rst time, ESA had two tracks, with separate program committees, which dealt respectively with: – the design and mathematical analysis of algorithms (the “Design and An- ysis” track); – real-world applications, engineering and experimental analysis of algorithms (the “Engineering and Applications” track). Previous ESAs were held in Bad Honnef, Germany (1993); Utrecht, The Neth- lands (1994); Corfu, Greece (1995); Barcelona, Spain (1996); Graz, Austria (1997); Venice, Italy (1998); Prague, Czech Republic (1999); Saarbruc ¨ ken, Ger- ? many (2000), and Arhus, Denmark (2001). The predecessor to the Engineering and Applications track of ESA was the Annual Workshop on Algorithm En- neering (WAE). Previous WAEs were held in Venice, Italy (1997), Saarbruc ¨ ken, ? Germany (1998), London, UK (1999), Saarbru ¨cken, Germany (2000), and Arhus, Denmark (2001). The proceedings of the previous ESAs were published as Springer LNCS volumes 726, 855, 979, 1284, 1461, 1643, 1879, and 2161. The proceedings of WAEs from 1999 onwards were published as Springer LNCS volumes 1668, 1982, and 2161.

Editors and Affiliations

  • Fakultät II: Mathematik und Naturwissenschaften, Technische Universität Berlin, Berlin, Germany

    Rolf Möhring

  • Department of Mathematics and Computer Science, University of Leicester, Leicester, UK

    Rajeev Raman

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation