Algorithms - ESA 2002: 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings (Lecture Notes in Computer Science (2461))

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. Solving Traveling Salesman Problems....Pages 1-1 Computing Shapes from Point Cloud Data....Pages 2-2 Mechanism Design for Fun and Profit....Pages 3-3 On Distance Oracles and Routing in Graphs....Pages 4-4 Kinetic Medians and kd -Trees....Pages 5-17 Range Searching in Categorical Data: Colored Range Searching on Grid....Pages 17-28 Near-Linear Time Approximation Algorithms for Curve Simplification....Pages 29-41 Translating a Planar Object to Maximize Point Containment....Pages 42-53 Approximation Algorithms for k -Line Center....Pages 54-63 New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem....Pages 64-74 SCIL — Symbolic Constraints in Integer Linear Programming....Pages 75-87 Implementing I/O-efficient Data Structures Using TPIE....Pages 88-100 On the k -Splittable Flow Problem....Pages 101-113 Partial Alphabetic Trees....Pages 114-125 Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router....Pages 126-138 Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy....Pages 139-150 Two Simplified Algorithms for Maintaining Order in a List....Pages 152-164 Efficient Tree Layout in a Multilevel Memory Hierarchy....Pages 165-173 A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons....Pages 174-186 TSP with Neighborhoods of Varying Size....Pages 187-199 1.375-Approximation Algorithm for Sorting by Reversals....Pages 200-210 Radio Labeling with Pre-assigned Frequencies....Pages 211-222 Branch-and-Bound Algorithms for the Test Cover Problem....Pages 223-233 Constructing Plane Spanners of Bounded Degree and Low Weight....Pages 234-246 Eager st -Ordering....Pages 247-256 Three-Dimensional Layers of Maxima....Pages 257-269 Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy....Pages 270-283 Geometric Algorithms for Density-Based Data Clustering....Pages 284-296 Balanced-Replication Algorithms for Distribution Trees....Pages 297-309 Butterflies and Peer-to-Peer Networks....Pages 310-322 Estimating Rarity and Similarity over Data Stream Windows....Pages 323-335 Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels....Pages 335-347 Frequency Estimation of Internet Packet Streams with Limited Space....Pages 348-360 Truthful and Competitive Double Auctions....Pages 361-373 Optimal Graph Exploration without Good Maps....Pages 374-386 Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee....Pages 387-398 Non-independent Randomized Rounding and an Application to Digital Halftoning....Pages 399-409 Computing Homotopic Shortest Paths Efficiently....Pages 411-423 An Algorithm for Dualization in Products of Lattices and Its Applications....Pages 424-435 Determining Similarity of Conformational Polymorphs....Pages 436-448 Minimizing the Maximum Starting Time On-line....Pages 449-460 Vector Assignment Problems: A General Framework....Pages 461-473 Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice....Pages 473-484 Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique....Pages 485-498 Online Companion Caching....Pages 499-511 Deterministic Communication in Radio Networks with Large Labels....Pages 512-524 A Primal Approach to the Stable Set Problem....Pages 525-537 Wide-Sense Nonblocking WDM Cross-Connects....Pages 538-550 Efficient Implementation of a Minimal Triangulation Algorithm....Pages 550-562 Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme....Pages 562-574 The Probabilistic Analysis of a Greedy Satisfiability Algorithm....Pages 574-586 Dynamic Additively Weighted Voronoi Diagrams in 2D....Pages 586-598 Time-Expanded Graphs for Flow-Dependent Transit Times....Pages 599-611 Partially-Ordered Knapsack and Applications to Scheduling....Pages 612-624 A Software Library for Elliptic Curve Cryptography....Pages 625-637 Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows....Pages 637-648 Randomized Approximation Algorithms for Query Optimization Problems on Two Processors....Pages 649-661 Covering Things with Things....Pages 662-674 On-Line Dial-a-Ride Problems under a Restricted Information Model....Pages 674-685 Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs....Pages 686-698 Engineering a Lightweight Suffix Array Construction Algorithm....Pages 698-710 Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations....Pages 711-722 External-Memory Breadth-First Search with Sublinear I/O....Pages 723-735 Frequency Channel Assignment on Planar Networks....Pages 736-747 Design and Implementation of Efficient Data Types for Static Graphs....Pages 748-759 An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem....Pages 760-772 A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options....Pages 772-784 Sorting 13 Elements Requires 34 Comparisons....Pages 785-794 Extending Reduction Techniques for the Steiner Tree Problem....Pages 795-807 A Comparison of Multicast Pull Models....Pages 808-819 Online Scheduling for Sorting Buffers....Pages 820-832 Finding the Sink Takes Some Time....Pages 833-844 Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design....Pages 845-858 Minimizing Makespan and Preemption Costs on a System of Uniform Machines....Pages 859-871 Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts....Pages 872-883 High-Level Filtering for Arrangements of Conic Arcs....Pages 884-896 An Approximation Scheme for Cake Division with a Linear Number of Cuts....Pages 896-901 A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs....Pages 902-913 Solving Traveling Salesman Problems / William Cook -- Computing Shapes From Point Cloud Data / Tamal K. Dey -- Mechanism Design For Fun And Profit / Anna R. Karlin -- On Distance Oracles And Routing In Graphs / Mikkel Thorup -- Kinetic Medians And Kd-trees / Pankaj K. Agarwal, Jie Gao And Leonidas J. Guibas -- Range Searching In Categorical Data: Colored Range Searching On Grid / Pankaj K. Agarwal, Sathish Govindarajan And S. Muthukrishnan -- Near-linear Time Approximation Algorithms For Curve Simplification / Pankaj K. Agarwal, Sariel Har-peled, Nabil H. Mustafa And Yusu Wang -- Translating A Planar Object To Maximize Point Containment / Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel Smid And Emo Welzl. Rolf Mohring, Rajeev Raman (eds.). Includes Bibliographical References And Index. Annotation This book constitutes the refereed proceedings of the 10th Annual European Symposium on Algorithms, ESA 2002, held in Rome, Italy, in September 2002. The 74 revised full papers presented were carefully reviewed and selected from a total of 201 submissions. The papers address all current issues in Algorithmics, in particular computational biology, computational finance, computational geometry, databases and information retrieval, external memory algorithms, graph and network algorithms, graph drawing, algorithmic learning, network design, online algorithms, parallel and distributed computing, pattern matching, data compression, quantum computing, randomized algorithms, and symbolic computation