Algorithm Engineering and Experiments: 4th International Workshop, Alenex 2002, San Francicsco, Ca, Usa, January 4-5, 2002, Revised Papers

ISBN-13: 9783540439776 / Angielski / Miękka / 2002 / 212 str.

P. M. Ulmschneider; D. M. Mount

Opis

Constituting the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisco, January 2002, these 15 revised full papers presented have been carefully reviewed and selected from 34 submissions.

Spis treści

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.