Karsten Weihe (auth.), Stefan Näher, Dorothea Wagner (eds.)3540425128, 9783540425120
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
Reviews
There are no reviews yet.