Algorithm Engineering and Experiments 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers /
Algorithm Engineering and Experiments 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers / [electronic resource] :
edited by David M. Mount, Clifford Stein.
- 1st ed. 2002.
- VIII, 212 p. online resource.
- Lecture Notes in Computer Science, 2409 1611-3349 ; .
- 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.
9783540456438
10.1007/3-540-45643-0 doi
Computer programming.
Software engineering.
Algorithms.
Artificial intelligence--Data processing.
Computer graphics.
Computer science--Mathematics.
Discrete mathematics.
Programming Techniques.
Software Engineering.
Algorithms.
Data Science.
Computer Graphics.
Discrete Mathematics in Computer Science.
QA76.6-76.66
005.11
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.
9783540456438
10.1007/3-540-45643-0 doi
Computer programming.
Software engineering.
Algorithms.
Artificial intelligence--Data processing.
Computer graphics.
Computer science--Mathematics.
Discrete mathematics.
Programming Techniques.
Software Engineering.
Algorithms.
Data Science.
Computer Graphics.
Discrete Mathematics in Computer Science.
QA76.6-76.66
005.11