Lecture Notes in Computer Science 1643 Edited by G. Goos, J. Hartmanis and J. van Leeuwen 3 Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Singapore Tokyo Jaroslav Nesetˇ rilˇ (Ed.)

Algorithms - ESA ’99

7th Annual European Symposium Prague, Czech Republic, July 16-18, 1999 Proceedings

13 Series Editors Gerhard Goos, Karlsruhe University, Germany Juris Hartmanis, , NY, USA Jan van Leeuwen, Utrecht University, The Netherlands

Volume Editor

Jaroslav Neˇsetˇril Charles University Department of Applied Mathematics and DIMATIA Centre Malostransk«en«am. 25, CZ-11800 Prague 1, Czech Republic E-mail: [email protected]

Cataloging-in-Publication data applied for

Die Deutsche Bibliothek - CIP-Einheitsaufnahme Algorithms : 7th annual European symposium ; proceedings / ESA ’99, Prague, Czech Republic, July 16 - 18, 1999. Jaroslav Neˇsetˇril (ed.). - Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London ; Milan ; Paris ; Singapore ; Tokyo : Springer, 1999 (Lecture notes in computer science ; Vol. 1643) ISBN 3-540-66251-0

CR Subject Classification (1998): F.2, G.1-2, E.1, F.1.3

ISSN 0302-9743 ISBN 3-540-66251-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. c Springer-Verlag Berlin Heidelberg 1999 Printed in Germany Typesetting: Camera-ready by author SPIN 10703529 06/3142Ð543210 Printedonacid-free paper Preface

The 7th Annual European Symposium on Algorithms (ESA ’99) is held in Prague, Czech Republic, July 16-18, 1999. This continued the tradition of the meetings which were held in

– 1993 Bad Honnef (Germany) – 1994 Utrecht (Netherlands) – 1995 Corfu (Greece) – 1996 Barcelona (Spain) – 1997 Graz (Austria) – 1998 Venice (Italy)

(The proceedings of previous ESA meetings were published as Springer LNCS vol- umes 726, 855, 979, 1136, 1284, 1461.) In the short time of its history ESA (like its sister meeting SODA) has become a popular and respected meeting. The call for papers stated that the “Symposium covers research in the use, design, and analysis of efficient algorithms and data structures as it is carried out in com- puter science, discrete applied mathematics and mathematical programming. Papers are solicited describing original results in all areas of algorithmic research, including but not limited to: Approximation Algorithms; Combinatorial Optimization; Computa- tional Biology; Computational Geometry; Databases and Information Retrieval; Graph and Network Algorithms; Machine Learning; Number Theory and Computer Algebra; On-line Algorithms; Pattern Matching and Data Compression; Symbolic Computation. The algorithms may be sequential, distributed or parallel, and they should be analyzed either mathematically or by rigorous computational experiments. Submissions that re- port on experimental and applied research are especially encouraged.” The total of 122 papers were received. The program committee thoroughly reviewed the papers (each paper was sent to at least 3 members of the PC) and after an electronic discussion the agreement was reached during the PC meeting in Prague, March 26- 28, 1999. (At this meeting the following members of PC were physically present: G. Billardi, H. Bodlaender, J. Diaz, A. Goldberg, M. Goemans, M. Kaufmann, B. Monien, J. Matouˇsek, E. Mayr, J. Neˇsetˇril, P. Widmayer, G. Woeginger, while most of the other PC members cooperated electronically.) The program committee selected 44 papers, which are presented in this volume. The program of ESA’ 99 includes two invited talks by Bernhard Korte () and Moti Yung (Columbia, New York). As an experiment, ESA’99 was held at the same time as ICALP’99. Only history will show whether this scheme is suitable to the European context. The ESA’99 was organized by the Centre of Discrete Mathematics, Theoretical Computer Science and Applications (shortly DIMATIA) which is a joint venture of Charles University, the Czech Academy of Science and the Institute for Chemical Tech- nology (all based in Prague) together with its associates (presently in Barcelona, Biele- VI Preface feld, Bonn, Bordeaux, Budapest, Novosibirsk, Pilsen, and Pisa). Also two similar cen- ters DIMACS (, New Jersey) and PIMS (Vancouver, Canada) are associated members of DIMATIA. We thank all our partners for the support and all the work. We would like to thank all the members of the organizing committee, and par- ticularly Mrs. Hana C´ˇ asensk´a (DIMATIA) and Mrs. Anna Kotˇeˇsovcov´a (CONFORG). The electronic efficiency was made possible by Jiˇr´ı Fiala, Jiˇr´ı Sgall, V´it Nov´ak, and Pavel Valtr. We also thank our industrial supporters Cedok,ˇ Telekom, Komerˇcn´ı banka, Mer- cedes Benz Bohemia, and Conforg (all based in Prague). DIMATIA is also supported by GACR grant 201/99/0242 and MSMTˇ grant 055 (Kontakt). We hope that the present volume reflects the manifold spectrum of contemporary algorithmic research and that it convincingly demonstrates that this area is alive and well. We wish the next ESA (to be held in Saarbruecken) success and many excellent contributions.

July 1999 Jaroslav Neˇsetˇril Organization

ESA’99 is organized by the

Conferece Chair

Jaroslav Neˇsetˇril (Charles University)

Organizing Comitee

H. C´ˇ asensk´a L. Kuˇcera J. Fiala H. Neˇsetˇrilov´a V. Janota V. N ovak ´ A. Kotˇeˇsovcov´a J. Sgall J. Kratochv´ıl P. Valtr

Program Comitee

H. Attiya (Haifa) M. Kaufmann (Tubingen) G. Ausiello () J. K. Lenstra (Eindhoven) G. Bilardi (Padua) J. Matouˇsek (Prague) H. Boadlander (Utrecht) E. Mayr (Munich) W. Cook (Houston) B. Monien (Paderborn) J. Diaz (Barcelona) B. Shepherd (Murray Hill) A. Frieze (Pittsburgh) P. Widmayer (Zurich) M. Goemans (Louvain) J. Wiederman (Prague) A. Goldberg (Princeton) G. Woeginger (Graz) G. Italiano (Venice) A. Zvonkin (Bordeaux) H. Karloff (Atlanta)

Referees

Karen Aardal Yossi Azar Fabian Chudak Susanne Albers Ricardo Baeza-Yates Edith Cohen Noga Alon Nicole Bidoit Gerard Cornuejols Carme Alvarez Vita Bortnikov Bruno Courcelle Fabrizio d’Amore Srecko Brlek Olivier Delgrange Matthew Andrews Prasad Chalasani Camil Demetrescu Richard Arratia Otfried Cheong Stephan Eidenbenz VIII Organization

Jens Ernst Flaminia Luccio David Sherman Sandor Fekete Conrado Mart´ınez David Shmoys Amos Fiat Colin McDiarmid Alistair Sinclair Joaquim Gabarro Michael Mitzenmacher Job Smeltink Giorgio Gambosi Haiko M¨uller A. Steger Cyril Gavoille Seffi Naor Cliff Stein Leslie Goldberg Gabriele Neyer Robert Strandh Ervin Gyori Rolf Niedermeier Wojtek Szapankowski Alexander Hall John Noga Gerard Tel M. T. Hallett Jordi Petit Prasad Tetali Johan Hastad Kirk Pruhs Roland Ulber Monika Henzinger Martin Raab Eli Upfal Cor Hurkens Yuval Rabani Bernard Vauquelin David Janin R. Ravi Marinus Veldhorst V´ıt Janota Thomas Roos Bram Verweij Bala Kalyanasundaram Guenter Rote Tandy Warnow Claire Kenyon S. Roura Roger Wattenhofer Bettina Klinz Thomas Schickinger Gordon Wilfong Ton Kloks Christophe Schlick Fatos Xhafa Werner Krandick Konrad Schlude Francis Zane Stefano Leonardi Petra Schuurman Wieslaw Zielonka Bertrand Le Saec Maria Serna Lisa Zhang Vincenzo Liberatore Oriol Serra Martin Loebl Ron Shamir Table of Contents

ESA’99 Program 1

Adaptively-Secure Distributed Public-Key Systems 4 Yair Frankel, Moti Yung (CertCo), Philip MacKenzie (Bell Laboratories, Mur- ray Hill)

How Long Does a Bit Live in a Computer? 28 Bernhard Korte (Bonn University)

Approximation Algorithms for the Traveling Purchaser Problem and Its Variants

in Network Design 29 R. Ravi, F. S. Salman (Carnegie Mellon University)

The Impact of Knowledge on Broadcasting Time in Radio Networks (Extended

Abstract) 41 Krzysztof Diks (Uniwersytet Warszawski), Danny Krizanc, Evangelos Kranakis (Carleton University, Ottawa), Andrzej Pelc (UniversiteduQu´ ebec)´

Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing 53 Kazuo Iwama (Kyoto University), Eiji Miyano (Kyushu Institute of Design)

IP Address Lookup Made Fast and Simple 65 Pierluigi Crescenzi, Leandro Dardini (Universita` degli Studi di Firenze), Roberto Grossi (Universita` degli Studi di Pisa)

On-Line Load Balancing in a Hierarchical Server Topology 77 Amotz Bar-Noy (Tel Aviv University), Ari Freund (Technion, Haifa), Joseph Naor (Bell Laboratories, Murray Hill)

Provably Good and Practical Strategies for Non-uniform Data Management in

Networks 89 Friedhelm Meyer auf der Heide, Matthias Westermann (University of Pader- born), Berthold Vocking¨ (International Computer Science Institute, Berkeley)

Approximation Algorithms for Restoration Capacity Planning 101 Steven J. Phillips, Jeffery R. Westbrook (AT&T Labs–Research)

Efficient Algorithms for Integer Programs with Two Variables per Constraint

(Extended Abstract) 116 Reuven Bar-Yehuda, Dror Rawitz

Convex Quadratic Programming Relaxations for Network Scheduling Problems 127 Martin Skutella (Technische Universitat¨ Berlin) X Table of Contents

Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving

Minimum Cut Problems 139 Rolf H. Mohring,¨ Frederik Stork, Marc Uetz (Technische Universitat¨ Berlin), Andreas S. Schulz (Sloan School of Management and Operations Research Center, Cambridge)

Approximation Schemes for Scheduling on Uniformly Related and Identical

Parallel Machines 151 Leah Epstein (Tel-Aviv University), Jirˇ´ı Sgall (AS CR, Charles University)

Off-Line Temporary Tasks Assignment 163 Yossi Azar, Oded Regev (Tel-Aviv University)

Load Balancing Using Bisectors – A Tight Average-Case Analysis 172 Stefan Bischof, Thomas Schickinger, Angelika Steger (Technische Universitat¨ Munchen)¨

On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really

Can Help 184 Thomas Jansen, Ingo Wegener (Univ. Dortmund)

Motif Statistics 194 Pierre Nicodeme` (DKFZ Theoretische Bioinformatik), Bruno Salvy, Philippe Flajolet (Inria Rocquencourt, France)

Approximate Protein Folding in the HP Side Chain Model on Extended Cubic

Lattices (Extended Abstract) 212 Volker Heun (Fakultat¨ fur¨ Informatik der TU Munchen)¨

On Constructing Suffix Arrays in External Memory 224 Andreas Crauser, Paolo Ferragina (Max-Planck-Institut fur¨ Informatik)

Strategies for Searching with Different Access Costs 236 Eduardo Sany Laber, Ruy Luiz Milidiu,´ Artur Alves Pessoa (Departamento de Informatica,´ PUC-Rio)

On the Informational Asymmetry between Upper and Lower Bounds for

Ultrametric Evolutionary Trees 248 Ting Chen (Harvard Medical School), Ming-Yang Kao ()

Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness 257 Ferdinando Cicalese (University of Salerno), Daniele Mundici (University of Milano)

Improving Mergesort for Linked Lists 267 Salvador Roura (Universitat Politecnica` de Catalunya) Table of Contents XI

Efficient Algorithms for On-Line Symbol Ranking Compression

(Extended Abstract) 277 Giovanni Manzini (Universita` del Piemonte Orientale)

On List Update and Work Function Algorithms 289 Eric J. Anderson, Anna R. Karlin (Univ. of Wash.), Kris Hildrum (Univ. of Calif.), April Rasala (Dartmouth College), Michael Saks (Rutgers Univ.)

The 3-Server Problem in the Plane (Extended Abstract) 301 Wolfgang W. Bein, Lawrence L. Larmore (University of Nevada), Marek Chrobak (University of California)

Quartet Cleaning: Improved Algorithms and Simulations 313 Vincent Berry (Universite´ de Saint-Etienne), Tao Jiang (McMaster Univer- sity), Paul Kearney, Ming Li (), Todd Wareham (McMaster University)

Fast and Robust Smallest Enclosing Balls 325 Bernd Gartner¨ (ETH Zurich)¨

Efficient Searching for Multi–dimensional Data Made Simple (Extended

Abstract) 339 Enrico Nardelli (Universita` di L’Aquila), Maurizio Talamo (Universitadi` Roma “La Sapienza”), Paola Vocca (Universita` di Roma “Tor Vergata”)

Geometric Searching over the Rationals 354 Bernard Chazelle (Princeton University)

On Computing the Diameter of a Point Set in High Dimensional Euclidean Space 366 Daniele V. Finocchiaro (Scuola Normale Superiore in Pisa), Marco Pellegrini (Institute for Computational Mathematics of CNR, Pisa)

A Nearly Linear-Time Approximation Scheme for the Euclidean k-median

Problem 378 Stavros G. Kolliopoulos, Satish Rao (NEC Research Institute, Princeton)

Sum Multi-coloring of Graphs 390 Amotz Bar-Noy (Tel-Aviv University), Magnus´ M. Halldorsson´ (University of Iceland), Guy Kortsarz (Open University, Tel Aviv), Ravit Salman, Hadas Shachnai (Technion, Haifa)

Efficient Approximation Algorithms for the Achromatic Number 402 Piotr Krysta (Max-Planck-Institut fur¨ Informatik, Saarbrucken),¨ Krzysztof

Lory´s (University of Wrocław)

Augmenting a k 1 -Vertex-Connected Multigraph to an -Edge-Connected and

k-Vertex-Connected Multigraph 414 Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki (Kyoto University) XII Table of Contents

An Optimisation Algorithm for Maximum Independent Set with Applications in

Map Labelling 426 Bram Verweij, Karen Aardal (Utrecht University) A Decomposition Theorem for Maximum Weight Bipartite Matchings with

Applications to Evolutionary Trees 438 Ming-Yang Kao (Yale University), Tak-Wah Lam, Wing-Kin Sung, Hing-Fung Ting (University of Hong Kong)

Faster Exact Solutions for Some NP-Hard Problems (Extended Abstract) 450 Limor Drori (Applied Materials), David Peleg (The Weizmann Institute of Science)

A Polyhedral Algorithm for Packings and Designs 462 Lucia Moura (University of Toronto)

Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms 476 Ali Akhavi (UniversitedeCaen)´

On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs 490 Alexander A. Ageev (Sobolev Institute of Mathematics, Novosibirsk) Dilworth’s Theorem and Its Application for Path Systems of a Cycle —

Implementation and Analysis 498 Andras´ A. Benczur´ (Hungarian Academy of Sciences), Jorg¨ Forster¨ (Hewlett Packard GmbH), Zoltan´ Kiraly´ (Eotv¨ os¨ University)

On 2-Coverings and 2-Packings of Laminar Families 510 Joseph Cheriyan (University of Waterloo), Tibor Jordan´ (University of Aarhus),

R. Ravi (Carnegie Mellon University)

j j Random Cayley Graphs with Olog G Generators Are Expanders 521 Igor Pak (Yale University) A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval

Graphs 527 Pavol Hell (Simon Fraser University), Ron Shamir, Roded Sharan (Tel Aviv University) A Fast General Methodology for Information — Theoretically Optimal

Encodings of Graphs 540 Xin He (State University of New York at Buffalo), Ming-Yang Kao (Yale University), Hsueh-I Lu (National Chung-Cheng University)

Author Index 551