Algorithm engineering and experiments : 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5. 2002 : revised papers / David Mount, Clifford Stein (eds.).
Contributor(s): Mount, David M | Stein, CliffordMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 2409.Publisher: Berlin : Springer, 2002Description: 1 online resource (viii, 205 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540456438; 3540456430Subject(s): Computer algorithms -- Congresses | Computer algorithmsGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:ALENEX 2002 (2002 : San Francisco, Calif.): Algorithm engineering and experiments : 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5. 2002 : revised papersDDC classification: 005.1 LOC classification: QA76.9.A43 | A42 2002Other classification: DAT 530f | SS 4800 Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
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 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.