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

381 Pages·1999·11.091 MB·English

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

Lecture Notes in Computer Science 1663
Edited by G. Goos, J. Hartmanis and 1. van Leeuwen
Springer
Berlin
Heidelberg
New York
Barcelona
Hong Kong
London
Milan
Paris
Singapore
Tokyo
Frank Dehne Arvind Gupta
Jorg-Rtidiger Sack Roberto Tamassia (Eds.)
Algorithms and
l)ataStructures
6th International Workshop, WADS'99
Vancouver, Canada, August 11-14, 1999
Proceedings
Springer
Series Editors
Gerhard Goos, Karlsruhe University, Germany
Juris Hartmanis, Cornell University, NY, USA
Jan van Leeuwen, Utrecht University, The Netherlands
Volume Editors
Frank Dehne
Jorg-Riidiger Sack
Carleton University, School of Computer Science
1125 Colonel By Drive, Ottawa, Canada KIS 5B6
E-mail: {dehne.sack}@scs.carleton.ca
Arvind Gupta
Simon Fraser University, School of Computing Science
Burnaby, BC, Canada V5A IS6
E-mail:[email protected]
Roberto Tamassia
Brown University, Center for Geometric Computing
Providence, RI 02912-1910, USA
E-mail: [email protected]
Cataloging-in-Publication data applied for
Die Deutsche Bibliothek - CIP-Einheitsaufnahme
Algorithms and data structures: 6th international workshop;
proceedings / WADS '99, Vancouver, Canada, August 11 - 14, 1999.
Frank Dehne ... (ed.). - Berlin; Heidelberg; New York; Barcelona;
Hong Kong ; London ; Milan ; Paris ; Singapore ; Tokyo : Springer,
1999
(Lecture notes in computer science; Vol. 1663)
ISBN 3-540-66279-0
CR Subject Classification (1998): F.2, E.l, G.2, 1.3.5, H.3.3
ISSN 0302-9743
ISBN 3-540-66279-0 Springer-Verlag Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved. whether the whole or part of the material is
concerned. specifically the rights of translation. reprinting. re-use of illustrations. recitation. broadcasting.
reproduction on microfilms or in any other way. and storage in data banks. Duplication of this publication
or parts thereof is permitted only under the provisions of the German Copyright Law of September 9. 1965.
in its current version. and permission for use must always be obtained from Springer-Verlag. Violations are
liable for prosecution under the German Copyright Law.
© Springer-Verlag Berlin Heidelberg 1999
Typesetting: Camera-ready by author
SPIN: 10704216 06/3142 - 5 4 3 2 I 0 Printed on acid-free paper
Preface
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.
Grama, M. Keil, D. Kirkpatrick, R. Krishnamurti, D.T. Lee, F. Luccio, A. Maheshwari,
G. Plaxton, A. Rau-Chaplin, J. Reif, F. Ruskey, P.G. Spirakis, L. Stewart, H.
Sudborough, P. Vitanyi, P. Widmayer, c.K. Wong
Invited Speakers:
C. Leiserson, N. Magnenat-Thalmann, M. Snir, U. Vazarani, J. Vitter
Local Organizing Committee:
B. Bhattacharya, A. Gupta, A. Liestman, T. Shermer
Sponsored by:
The Pacific Institute for Mathematical Sciences
WADS Steering Committee:
F. Dehne, I. Munro, J.-R. Sack, N. Santoro, R. Tamassia
Table of Contents
Optimization over k-set Polytopes and Efficient k-set Enumeration
A. Andrzejak, K. Fukuda
Line Simplification with Restricted Orientations 13
G. Neyer
The T-join Problem in Sparse Graphs: Applications to Phase Assignment 25
Problem in VLSI Mask Layout
P. Berman, A. B. Kahng, D. Vidhani, A. Zelikovsky
Resizable Arrays in Optimal Time and Space 37
A. Brodnik, S. Carlsson, E.D. Demaine, 1.I. Munro, R. Sedgewick
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions 49
R. Pagh
Invited Talk: Design and Analysis of Algorithms for Shared-Memory 55
Multiprocessors
C.E. Leiserson
On the Complexity of Orthogonal Compaction 56
M. Patrignani
Optimizing Constrained Offset and Scaled Polygonal Annuli 62
G. Barequet, P. Bose, M.T. Dickerson
The Accommodating Function -A Generalization of the Competitive Ratio 74
J. Boyar, K.S. Larsen, M.N. Nielsen
Performance Guarantees for the TSP with a Parameterized Triangle 80
Inequality
M.A. Bender, C. Chekuri
Robot Map Verification of a Graph World 86
X. Deng, E. Milios, A. Mirzaian
Searching Rectilinear Streets Completely 98
C.A. Broecker, S. Schuierer
General Multiprocessor Task Scheduling: Approximate Solutions in Linear 110
Time
K. Jansen, L. Porkolab
VIII
The Lazy Bureaucrat Scheduling Problem 122
E.M. Arkin, M.A. Bender, J.S.B. Mitchell, S.S. Skiena
Invited Talk: Generating 3D Virtual Populations from Pictures of a Few 134
Individuals
N. Magnenat-Thalmann, W. Lee, P. Beylot, D. Sankoff
Testing the Quality of Manufactured Balls 145
P. Bose, P. Morin
On an Optimal Split Tree Problems 157
S.R. Kosaraju, T.M. Przytycka, R. Borgstrom
Representing Trees of Higher Degree 169
D. Benoit, E.D. Demaine, J.I. Munro, V. Raman
Indexing and Dictionary Matching with One Error 181
A. Amir, D. Keselman, G.M. Landau, M. Lewenstein, N. Lewenstein,
M. Rodeh
New Results on Fault Tolerant Geometric Spanners 193
T. Lukovszki
Tiered Vectors: Efficient Dynamic A rrays for Rank-Based Sequences 205
M.T. Goodrich, J.G. Kloss II
Invited Talk: Go-with-the-Winner Heuristic 217
V.V. Vazirani
2-Point Site Voronoi Diagrams 219
G. Barequet, M.T. Dickerson, R.L.S. Drysdale
A Parallel Algorithmfor Finding the Constrained Voronoi Diagram of Line 231
Segments in the Plane
F. Chin, D.T. Lee, c.A. Wang
Position-Independent Street Searching 241
C.A. Broecker, A. Lopez-Ortiz
Approximation Algorithms for 3-D Common Substructure Identification in 253
Drug and Protein Molecules
S. Chakraborty, S. Biswas
A Tight Bound for Beta-Skeleton of Minimum Weight Triangulations 265
c.A. Wang, B. Yang
IX
Rectilinear Static and Dynamic Discrete 2-Center Problems 276
S. Bespamyatnikh, M. Segal
Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed- 288
Parameter Tractable
U. Stege
Efficient Web Searching Using Temporal Factors 294
A. Czumaj, I. Finch, L. Gasieniec, A. Gibbons, P. Leng, W. Rytter, M. Zito
Elastic Labels Around The Perimeter of a Map 306
C. Iturriaga, A. Lubiw
Optimal Facility Location under Various Distance Functions 318
S. Bespamyatnikh, K. Kedem, M. Segal
Thresholds for Sports Elimination Numbers: Algorithms and Complexity 330
D. Gusfield, C. Martel
Dynamic Representations of Sparse Graphs 342
G.S. Brodal, R. Fagerberg
Invited Talk: Online Data Structures in External Memory 352
1.S. Vitter
Author Index 367