Algorithm engineering : 3rd International Workshop, WAE&#039,99 London, UK, July 19-21, 1999 : proceedings

Algorithm Engineering: 3rd International Workshop, WAE’99 London, UK, July 19–21, 1999 Proceedings
Author: Jeffrey S. Vitter, Christos D. Zaroliagis
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66427-7
DOI: 10.1007/3-540-48318-7

Table of Contents:

• Selecting Problems for Algorithm Evaluation
• BSP Algorithms — “Write Once, Run Anywhere”
• Ten Years of LEDA: Some Thoughts
• Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
• Efficient Implementation of Lazy Suffix Trees
• Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism
• Finding Minimum Congestion Spanning Trees
• Evaluation of an Algorithm for the Transversal Hypergraph Problem
• Construction Heuristics and Domination Analysis for the Asymmetric TSP
• Counting in Mobile Networks: Theory and Experimentation
• Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
• Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
• On-Line Zone Construction in Arrangements of Lines in the Plane
• The Design and Implementation of Planar Maps in CGAL
• An Easy to Use Implementation of Linear Perturbations within Cupgal
• Analysing Cache Effects in Distribution Sorting
• Fast Regular Expression Search
• An Experimental Evaluation of Hybrid Data Structures for Searching
• LEDA-SM: Extending LEDA to Secondary Memory
• A Priority Queue Transform

"This volume contains the papers accepted for presentation at the 3rd International Workshop on Algorithm Engineering (WAE'99) held in London, UK, on July 19-21, 1999"--Introd
Includes bibliographical references and index