Algorithm engineering and experiments : 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002 : revised papers
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
2409 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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 and experiments, 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5. 2002, revised papers, David Mount, Clifford Stein (eds.), Berlin, Springer, 2002, 1 vol. (VIII-205 p.), Lecture notes in computer science, 3-540-43977-3 • Algorithm Engineering and Experiments, Texte imprimé, 9783662181553 |
Table des matières:
- ALENEX 2002
- On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
- A Time-Sensitive System for Black-Box Combinatorial Optimization
- A Compressed Breadth-First Search for Satisfiability
- Using Multi-level Graphs for Timetable Information in Railway Systems
- Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation
- An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web
- The Treewidth of Java Programs
- Partitioning Planar Graphs with Costs and Weights
- Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
- Experimental Evaluation of a New Shortest Path Algorithm
- Getting More from Out-of-Core Columnsort
- Topological Sweep in Degenerate Cases
- Acceleration of K-Means and Related Clustering Algorithms
- STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
- An Improvement on Tree Selection Sort.