Lecture Notes in Computer Science

Transcription

1 Lecture Notes in Computer Science Edited by G. Goos, J. Hartmanis and J. van Leeuwen 855 Advisory Board: W. Brauer D. Gries J. Stoer

2 Jan van Leeuwen (Ed.) Algorithms - ESA'94 Second Annual European Symposium Utrecht, The Netherlands, September 26-28, 1994 Proceedings Springer-Verlag Berlin Heidelberg NewYork London Paris Tokyo Hong Kong Barcelona Budapest

3 Series Editors Gerhard Goos Universit~it Karlsruhe Postfach 69 80, Vincenz-Priessnitz-StraBe 1, D Karlsrnhe, Germany Juris Hartmanis Department of Computer Science, Cornell University 4130 Upson Hall, Ithaka, NY 14853, USA Jan van Leeuwen Department of Computer Science, Utrecht University Padualaan 14, 3584 CH Utrecht, The Netherlands Volume Editor Jan van Leeuwen Department of Computer Science, Utrecht University Padualaan 14, 3584 CH Utrecht, The Netherlands CR Subject Classification (1991): E2, G.2-4, 1.3.5, E.1, E.5, 1.7.3, B.4.3, C.1.2, C.2.1 ISBN X Springer-Verlag Berlin Heidelberg New York CIP data applied for 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. 9 Springer-Verlag Berlin Heidelberg 1994 Printed in Germany Typesetting: Camera-ready by author SPIN: / Printed on acid-free paper

4 Preface The 2nd Annual European Symposium on Algorithms (ESA'94) was held September 26-28, 1994, near Utrecht (the Netherlands), in the conference facilities of the 'National Sports Centre Papendal' of the Dutch National Sports Federation. This volume contains all contributed papers presented at the symposium, together with extended abstracts of the invited lectures by Andrew V. Goldberg (Stanford University) and Gaston H. Gonnet (ETH Ziirich). ESA was established in 1993 as a main annual event for all researchers interested in algorithms, theoretical as well as applied. The international symposium covers all research on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied mathematics and all other areas of algorithm-oriented research and its application. The proceedings of ESA'93 appeared as Volume 726 in the series Lecture Notes in Computer Science. In response to the Call for Papers for ESA'94, the program committee received 159 submissions, indicating a strong and growing interest in the symposium. The program committee for ESA'94 consisted of: Helmut Alt (Berlin) Giuseppe di Battista (Rome) Philippe Flajolet (Paris) Alon Itai (Haifa) Lefteris Kirousis (Patras) Jan van Leeuwen (Utrecht, chairman) Thomas Lengauer (Sankt Augustin) Jan Karel Lenstra (Eindhoven) Andrzej Lingas (Lund) Bill McColl (Oxford) Friedhelm Meyer a. d. Heide (Paderborn) Wojciech Rytter (Warsaw) The program committee met on May 16, 1994, in Utrecht and selected 42 contributed papers for inclusion in the scientific program of ESA'94. The selection was based on originality, quality, and relevance to the study of algorithms, and reflects many of the current directions in algorithms research. We wish to thank all those who submitted extended abstracts for consideration, and all subreferees and colleagues who helped in the extensive evaluation process.

5 yl The scientific program of ESA'94 evidently shows the gradual expansion of algorithms research into new areas of computational endeavor in science and industry, and the program committee hopes that this component will continue to manifest itself as part of the ESA program in future years. Many thanks are due to the organizing committee of ESA'94 for making the symposium happen. The organizing committee consisted of: Hans Bodlaender, Marko de Groot, Jan van Leeuwen, Margje Punt, and Marinus Veldhorst, all from the Department of Computer Science of Utrecht University. ESA'94 was sponsored by the Association for Computing Machinery (ACM), the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), the European Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). We are grateful to the Royal Dutch Academy of Sciences (KNAW) and Utrecht University for supporting ESA'94. We thank the 'National Sports Centre Papendal' of the Dutch National Sports Federation for allowing the use of its excellent conference facilities for the symposium, the Department of Computer Science of Utrecht University for supporting the organization of ESA'94, and Margje Punt for invaluable assistance in all matters related to the symposium. Utrecht, September 1994 Jan van Leeuwen

6 Contents Invited Lectures Optimization Algorithms for Large Networks... 1 A. V. Goldberg Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value G.H. Gonnet Automatic Graph Drawing and Rendering Planar Drawings and Angular Resolution: Algorithms and Bounds A. Garg, R. Tamassia A Better Heuristic for Orthogonal Graph Drawings T. Biedl, G. Kant Hamiltonian Triangulations for Fast Rendering E.M. Arkin, M. Held, J.S.B. Mitchell, S.S. Skiena Spanners and Steiner Trees Efficient Construction of a Bounded Degree Spanner with Low Weight S. Arya, M. Staid Approaching the 5/4-Approximation for Rectilinear Steiner Trees P. Berman, U. FSssmeier, M. Karpinski, M. Kaufmann, A. Zelikovsky Efficient Datastructures and Complexity Analysis Membership in Constant Time and Minimum Space A. Brodnik, J.I. Munro Faster Searching in Tries and Quadtrees - An Analysis of Level Compression A. Andersson, S. Nilsson The Analysis of a Hashing Scheme by tile Diagonal Poisson Transform P.V. Poblete, A. Viola, J.L Munro Some Lower Bounds for Comparison-Based Algorithms S. Carlsson, J. Chen Graph Algorithms I An Efficient Algorithm for Edge-Ranking Trees X. Zhou, T. Nishizeki

7 VIII Edge-Disjoint (s, t)-paths in Undirected Planar Graphs in Linear Time K. Weihe A Simple Min Cut Algorithm, M. Stoer, F. Wagner Approximation Algorithm on Multi-Way Maxcut Partitioning J.D. Cho, S. Raje, M. Sarrafzadeh A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph V. Chepoi, F. Dragan Distributed Algorithms The Time Complexity of Updating Snapshot Memories A. Israeli, A. Shirazi Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking G. Parlati, M. Yung On-Line Distributed Data Management C. Lund, N. Reingold, J. Westbrook, D. Yah Computational Geometry A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images T. Asano, N. Katoh, T. Tokuyama How to Compute the Voronoi Diagram of Line Segments: Theoretical and Practical Results C. Burnikel, K. Mehlhorn, S. Schirra Range Searching and Point Location among Fat Objects M.H. Overmars, A.F. van der Stappen Computational Geometry and Robotics Convex Tours of Bounded Curvature J.-D. Boissonnat, J. Czyzowicz, O. Devillers, J.-M. Robert, M. Yvinec Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles Y.-J. Chiang, R. Tamassia Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects P. Gupta, R. Janardan, M. Staid

8 IX Operations Research and Combinatorial Optimization Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles I. Schiermeyer An Optimal Algorithm for Preemptive On-Line Scheduling B. Chen, A. van Vliet, G.J. Woeginger Tight Approximations for Resource Constrained Scheduling Problems A. Srivastav, P. Stangier An Algorithm for 0-1 Programming with Application to Airline Crew Scheduling D. Wedelin Graph Algorithms II An o(n) Work EREW Parallel Algorithm for Updating MST S.K. Das, P. Ferragina On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's P.G. Franciosa, G. Gambosi, U. Nanni Finding and Counting Given Length Cycles N. Alon, R. Yuster, U. Zwick Parallel Computation and Interconnection Networks Greedy Hot-Potato Routing on the Mesh I. Ben-Aroya, A. Schuster Desnakification of Mesh Sorting Algorithms J.F. Sibeyn Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy A. Pietracaprina, G. Pucei PRAM Computations Resilient to Memory Faults B.S. Chlebus, A. Gambin, P. Indyk An Area Lower Bound for a Class of Fat-Trees G. Bilardi, P. Bay Complexity Theory A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs H.B. Hunt III, M. V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, R.E. Stearns

9 The Parallel Complexity of Eden Growth, Solid-on-Solid Growth and Ballistic Deposition R. Greenlaw, J. Machta A New Approach to Resultant Computations and Other Algorithms with Exact Division A. Sch~nhage, E. Vetter Text Processing Algorithms Testing Equivalence of Morphisms on Context-Free Languages W. Plandowski Work-Time Optimal Parallel Prefix Matching L. Gqsieniec, K. Park On the Exact Complexity of the String Prefix-Matching Problem D. Breslauer, L. Colussi, L. Toniolo Incremental Text Editing: A New Data Structure P. Ferragina Erratum to the ESA '93 Proceedings Authors Index