Algorithm engineering : 4th international workshop, WAE 2000, Saarbrücken, Germany, September 2000 : proceedings
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 o...
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
1982 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithm engineering, 4th international workshop, WAE 2000, Saarbrücken, Germany, September 2000, proceedings, Stefan Näher, Dorothea Wagner )eds.), 2001, Berlin, Springer, 1 vol. (VIII-241 p.), Lecture notes in computer science, 3-540-42512-8 • Algorithm Engineering, Texte imprimé, 9783662193013 |
Inhaltsangabe:
- 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.