ISBN: 3-540-66251-0
TITLE: Algorithms - ESA'99
AUTHOR: Nesetril, Jaroslav (Ed.)
TOC:

ESA'99 Program 1
Adaptively-Secure Distributed Public-Key Systems 4
Yair Frankel, Moti Yung (CertCo), Philip MacKenzie (Bell Laboratories, Murray 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 (Universit du Qubec)
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 (Universit degli Studi di Firenze), Roberto Grossi (Universit 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 Paderborn), Berthold Vcking (International Computer Science Institute, Berkeley)
Approximation Algorithms for Restoration Capacity Planning 101
Steven J. Phillips, Jeffery R. Westbrook (AT&T LabsResearch)
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 Universitt Berlin)
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems 139
Rolf H. Mhring, Frederik Stork, Marc Uetz (Technische Universitt 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 Universitt Mnchen)
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help 184
Thomas Jansen, Ingo Wegener (Univ. Dortmund)
Motif Statistics 194
Pierre Nicodme (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 (Fakultt fr Informatik der TU Mnchen)
On Constructing Suffix Arrays in External Memory 224
Andreas Crauser, Paolo Ferragina (Max-Planck-Institut fr Informatik)
Strategies for Searching with Different Access Costs 236
Eduardo Sany Laber, Ruy Luiz Milidi, Artur Alves Pessoa (Departamento de Informtica, PUC-Rio)
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees 248
Ting Chen (Harvard Medical School), Ming-Yang Kao (Yale University)
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 Politcnica de Catalunya)
Efficient Algorithms for On-Line Symbol Ranking Compression (Extended Abstract) 277
Giovanni Manzini (Universit 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 (Universit de Saint-Etienne), Tao Jiang (McMaster University), Paul Kearney, Ming Li (University of Waterloo), Todd Wareham (McMaster University)
Fast and Robust Smallest Enclosing Balls 325
Bernd Grtner (ETH Zrich)
Efficient Searching for Multidimensional Data Made Simple (Extended Abstract) 339
Enrico Nardelli (Universit di L'Aquila), Maurizio Talamo (Universit di Roma "La Sapienza"), Paola Vocca (Universit 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), Magns M. Halldrsson (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 fr Informatik, Saarbrcken), Krzysztof Lorys (University of Wroclaw)
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)
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 (Universit de Caen)
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
Andrs A. Benczr (Hungarian Academy of Sciences), Jrg Frster (Hewlett Packard GmbH), Zoltn Kirly (Etvs University)
On 2-Coverings and 2-Packings of Laminar Families 510
Joseph Cheriyan (University of Waterloo), Tibor Jordn (University of Aarhus), R. Ravi (Carnegie Mellon University)
Random Cayley Graphs with O (log|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
END
