TY  - BOOK
AU  - Mount,David M.
AU  - Stein,Clifford
ED  - SpringerLink (Online service)
TI  - Algorithm Engineering and Experiments: 4th International Workshop, ALENEX 2002 San Francisco, CA, USA, January 4–5, 2002 Revised Papers 
T2  - Lecture Notes in Computer Science,
SN  - 9783540456438
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 2002///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Data structures (Computer science)
KW  - Computer software
KW  - Electronic data processing
KW  - Computational complexity
KW  - Computer graphics
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Data Structures
KW  - Computer Graphics
KW  - Discrete Mathematics in Computer Science
KW  - Numeric Computing
N1  - 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
UR  - http://dx.doi.org/10.1007/3-540-45643-0
ER  -