Algorithms – ESA &#039,99 : 7th annual European symposium, Prague, Czech Republic, July 16-18, 1999 : proceedings

Algorithms - ESA’ 99: 7th Annual European Symposium Prague, Czech Republic, July 16–18, 1999 Proceedings
Author: Jaroslav Nešetřil
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66251-8
DOI: 10.1007/3-540-48481-7

Table of Contents:

• ESA’99 Program
• Adaptively-Secure Distributed Public-Key Systems
• How Long Does a Bit Live in a Computer?
• Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design
• The Impact of Knowledge on Broadcasting Time in Radio Networks
• Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing
• IP Address LookupMade Fast and Simple
• On-Line Load Balancing in a Hierarchical Server Topology
• Provably Good and Practical Strategies for Non-uniform Data Management in Networks
• Approximation Algorithms for Restoration Capacity Planning
• Efficient Algorithms for Integer Programs with Two Variables per Constraint
• Convex Quadratic Programming Relaxations for Network Scheduling Problems
• Resource-Constrained Project Scheduling:Computing Lower Bounds by Solving Minimum Cut Problems
• Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
• Off-Line Temporary Tasks Assignment
• Load Balancing Using Bisectors — A Tight Average-Case Analysis
• On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can Help
• Motif Statistics
• Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices (Extended Abstract)
• On Constructing Suffix Arrays in External Memory

Includes bibliographical references