Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings

Karsten Weihe (auth.), Stefan Näher, Dorothea Wagner (eds.)3540425128, 9783540425120

This volume contains the papers accepted for the 4th Workshop on Algorithm Engineering (WAE 2000) held in Saarbruc ¨ ken, Germany, during 5–8 September 2000, together with the abstract of the invited lecture given by Karsten Weihe. The Workshop on Algorithm Engineering covers research on all aspects of the subject. The goal is to present recent research results and to identify and explore directions for future research. Previous meetings were held in Venice (1997), Saarbruc ¨ ken (1998), and London (1999). Papers were solicited describing original research in all aspects of algorithm engineering, including: – Development of software repositories and platforms which allow the use of and experimentation with e?cient discrete algorithms. – Novel uses of discrete algorithms in other disciplines and the evaluation of algorithms for realistic environments. – Methodological issues including standards in the context of empirical – search on algorithms and data structures. – Methodological issues regarding the process of converting user requirements into e?cient algorithmic solutions and implementations. The program committee accepted 16 from a total of 30 submissions. The program committee meeting was conducted electronically. The criteria for sel- tion were originality, quality, and relevance to the subject area of the workshop. Considerable e?ort was devoted to the evaluation of the submissions and to p- viding the authors with feedback. Each submission was reviewed by at least four program committee members (assisted by subreferees). A special issue of the ACM Journal of Experimental Algorithmics will be devoted to selected papers from WAE 2000.

---

Table of contents :
On the Differences between “Practical” and “Applied”….Pages 1-10
An Experimental Study of Online Scheduling Algorithms….Pages 11-22
Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures….Pages 23-38
Pushing the Limits in Sequential Sorting….Pages 39-50
Efficient Sorting Using Registers and Caches….Pages 51-62
Lattice Basis Reduction with Dynamic Approximation….Pages 63-73
Clustering Data without Prior Knowledge….Pages 74-86
Recognizing Bundles in Time Table Graphs – A Structural Approach….Pages 87-98
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks….Pages 99-110
Portable List Ranking: An Experimental Study….Pages 111-122
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM….Pages 123-134
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms….Pages 135-146
Visualizing Algorithms Over the Web with the Publication-Driven Approach….Pages 147-158
Interchanging Tw Segments of an Array in a Hierarchical Memory System….Pages 159-170
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves….Pages 171-182
Planar Point Location for Large Data Sets: To Seek or Not to Seek….Pages 183-194
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees….Pages 195-206
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees….Pages 207-217
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study….Pages 218-229
New Algorithms for Examination Timetabling….Pages 230-241