Algorithm engineering : 4th international workshop, WAE 2000, Saarbrücken, Germany, September 5 8, 2000 : pro | International Workshop on Algorithm Engineering (4th : 2000 : Saarbrücken, Germany), Näher, Stefan, Wagner, Dorothea

Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings
Author: Stefan Näher, Dorothea Wagner
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42512-0
DOI: 10.1007/3-540-44691-5

Table of Contents:

• On the Differences between “Practical” and “Applied”
• An Experimental Study of Online Scheduling Algorithms
• Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures
• Pushing the Limits in Sequential Sorting
• Efficient Sorting Using Registers and Caches
• Lattice Basis Reduction with Dynamic Approximation
• Clustering Data without Prior Knowledge
• Recognizing Bundles in Time Table Graphs - A Structural Approach
• Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks
• Portable List Ranking: An Experimental Study
• Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
• Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms
• Visualizing Algorithms Over the Web with the Publication-Driven Approach
• Interchanging Tw Segments of an Array in a Hierarchical Memory System
• Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
• Planar Point Location for Large Data Sets: To Seek or Not to Seek
• Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees
• Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
• Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
• New Algorithms for Examination Timetabling

Includes bibliographical references and index
On the Differences between "Practical" and "Applied" / Karsten Weihe -- An Experimental Study of Online Scheduling Algorithms / Susanne Albers and Bianca Schroder -- Implementation of O(nm log n) Weighted Matchings in General Graphs. The Power of Data Structures / Kurt Mehlhorn and Guido Schafer -- Pushing the Limits in Sequential Sorting / Stefan Edelkamp and Patrick Stiegeler -- Efficient Sorting Using Registers and Caches / Lars Arge, Jeff Chase and Jeffrey S. Vitter / [and others] -- Lattice Basis Reduction with Dynamic Approximation / Werner Backes and Susanne Wetzel -- Clustering Data without Prior Knowledge / Javed Aslam, Alain Leblanc and Clifford Stein -- Recognizing Bundles in Time Table Graphs -- A Structural Approach / Annegret Liebers and Karsten Weihe -- Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks / I. Chatzigiannakis, S. Nikoletseas and P. Spirakis -- Portable List Ranking: An Experimental Study / Isabelle Guerin Lassous and Jens Gustedt -- Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM / Kazuo Iwama, Daisuke Kawai and Shuichi Miyazaki / [et al.] -- Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms / Peter Sanders and Rudolf Fleischer -- Visualizing Algorithms over the Web with the Publication-Driven Approach / Camil Demetrescu, Irene Finocchi and Giuseppe Liotta -- Interchanging Two Segments of an Array in a Hierarchical Memory System / Jesper Bojesen and Jyrki Katajainen -- Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves / Iddo Hanniel and Dan Halperin -- Planar Point Location for Large Data Sets: To Seek or Not to Seek / Jan Vahrenhold and Klaus H. Hinrichs -- Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees / Thomas Erlebach and Klaus Jansen -- Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees / Guido Proietti -- Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study / Camil Demetrescu, Daniele Frigioni and Alberto Marchetti-Spaccamela / [et al.] -- New Algorithms for Examination Timetabling / Massimiliano Caramia, Paolo Dell'Olmo and Giuseppe F. Italiano