Details

Autor(en) / Beteiligte

• ALENEX 2002
• ALENEX 2002
• Mount, David M[Herausgeber]
• Stein, Clifford[Herausgeber]

Titel

Algorithm Engineering and Experiments : 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers [electronic resource]

Auflage

1st ed. 2002

Ort / Verlag

Berlin, Heidelberg : Springer Berlin Heidelberg

Erscheinungsjahr

2002

Link zum Volltext

• SpringerLink Books - AutoHoldings

Verknüpfte Titel

Beschreibungen/Notizen

• Bibliographic Level Mode of Issuance: Monograph
• Includes bibliographical references and index.
• 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.
• English