算法工程与实验（会议录）

　　This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering and Experiments， ALENEX 2002， held in San Francisico， CA， USA in January 2002.The 15 revised full papers presented were carefully reviewed and selected from 34 submissions. Among the topics addressed are hewistics for algorithms， combinatorial optimization， searching， graph computation， network optimization， scheduling， computational geometry， sorting， and clustering algorithms.

暂缺《算法工程与实验（会议录）》作者简介

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 Satisfiabilitv
　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 Exoerimental Study
　Experimental Evaluation of a New Shortest Path Algorithm
　Getting More from Out-of-Core Columnsort
VIII Table of Contents
　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
Author Index