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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Näher, Stefan (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Wagner, Dorothea (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 1982
• Θέματα: Computer programming.; Computers.; Algorithms.; Numerical analysis.; Data structures (Computer science).; Computer communication systems.; Programming Techniques.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Numeric Computing.; Data Structures.; Computer Communication Networks.

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...

Πίνακας περιεχομένων:

• Invited Lectures
• On the Differences between "Practical" and "Applied"
• Contributed Papers
• 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.