Algorithms and Data Structures: 6th International Workshop, WADS’99 Vancouver, Canada, August 11–14, 1999 Proceedings

Artur Andrzejak, Komei Fukuda (auth.), Frank Dehne, Jörg-Rüdiger Sack, Arvind Gupta, Roberto Tamassia (eds.)3540662790, 9783540662792

The papers in this volume were presented at the Sixth Workshop on Algorithms and Data Structures (WADS ’99). The workshop took place August 11 – 14, 1999, in Vancouver, Canada. The workshop alternates with the Scandinavian Workshop on Algorithms Theory (SWAT), continuing the tradition of SWAT and WADS starting with SWAT’88 and WADS’89. In response to the program committee’s call for papers, 71 papers were submitted. From these submissions, the program committee selected 32 papers for presentation at the workshop. In addition to these submitted papers, the program committee invited the following researchers to give plenary lectures at the workshop: C. Leiserson, N. Magnenat-Thalmann, M. Snir, U. Vazarani, and 1. Vitter. On behalf of the program committee, we would like to express our appreciation to the six plenary lecturers who accepted our invitation to speak, to all the authors who submitted papers to W ADS’99, and to the Pacific Institute for Mathematical Sciences for their sponsorship. Finally, we would like to express our gratitude to all the people who reviewed papers at the request of the program committee. August 1999 F. Dehne A. Gupta J.-R. Sack R. Tamassia VI Conference Chair: A. Gupta Program Committee Chairs: F. Dehne, A. Gupta, J.-R. Sack, R. Tamassia Program Committee: A. Andersson, A. Apostolico, G. Ausiello, G. Bilardi, K. Clarkson, R. Cleve, M. Cosnard, L. Devroye, P. Dymond, M. Farach-Colton, P. Fraigniaud, M. Goodrich, A.

---

Table of contents :
Optimization over k-set Polytopes and Efficient k-set Enumeration….Pages 1-12
Line Simplification with Restricted Orientations….Pages 13-24
The T -join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout….Pages 25-36
Resizable Arrays in Optimal Time and Space….Pages 37-48
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions….Pages 49-54
Design and Analysis of Algorithms for Shared-Memory Multiprocessors….Pages 55-55
On the Complexity of Orthogonal Compaction….Pages 56-61
Optimizing Constrained Offset and Scaled Polygonal Annuli….Pages 62-73
The Accomodating Function — A Generalization of the Competitive Ratio….Pages 74-79
Performance Guarantees for the TSP with a Parameterized Triangle Inequality….Pages 80-85
Robot Map Verification of a Graph World….Pages 86-97
Searching Rectilinear Streets Completely….Pages 98-109
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time….Pages 110-121
The Lazy Bureaucrat Scheduling Problem….Pages 122-133
Generating 3D Virtual Populations from Pictures of a Few Individuals….Pages 134-144
Testing the Quality of Manufactured Balls….Pages 145-156
On an Optimal Split Tree Problem….Pages 157-168
Representing Trees of Higher Degree….Pages 169-180
Indexing and Dictionary Matching with One Error (Extended Abstract)….Pages 181-192
New Results on Fault Tolerant Geometric Spanners….Pages 193-204
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences….Pages 205-216
Go-With-The-Winners Heuristic….Pages 217-218
2-Point Site Voronoi Diagrams….Pages 219-230
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane….Pages 231-241
Position-Independent Street Searching….Pages 241-252
Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules….Pages 253-264
A Tight Bound for β-Skeleton of Minimum Weight Triangulations….Pages 265-276
Rectilinear Static and Dynamic Discrete 2-center Problems….Pages 276-287
Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed-Parameter Tractable….Pages 288-293
Efficient Web Searching Using Temporal Factors….Pages 294-305
Elastic Labels Around the Perimeter of a Map….Pages 306-317
Optimal Facility Location under Various Distance Functions….Pages 318-329
Thresholds for Sports Elimination Numbers: Algorithms and Complexity….Pages 330-341
Dynamic Representations of Sparse Graphs….Pages 342-351
Online Data Structures in External Memory….Pages 352-366