Normal view MARC view ISBD view

Algorithm Engineering and Experiments 4th International Workshop, ALENEX 2002 San Francisco, CA, USA, January 4–5, 2002 Revised Papers / [electronic resource] : edited by David M. Mount, Clifford Stein. - Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. - VIII, 212 p. online resource. - Lecture Notes in Computer Science, 2409 0302-9743 ; . - Lecture Notes in Computer Science, 2409 .

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.

ISBN: 9783540456438

Standard No.: 10.1007/3-540-45643-0 doi

Subjects--Topical Terms:
Computer science.
Data structures (Computer science).
Computer software.
Electronic data processing.
Computational complexity.
Computer graphics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Data Structures.
Computer Graphics.
Discrete Mathematics in Computer Science.
Numeric Computing.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1