Cantitate/Preț
Produs

Algorithm Engineering and Experiments: 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers: Lecture Notes in Computer Science, cartea 2409

Editat de David M. Mount, Clifford Stein
en Limba Engleză Paperback – 24 iul 2002

Din seria Lecture Notes in Computer Science

Preț: 32860 lei

Preț vechi: 41075 lei
-20% Nou

Puncte Express: 493

Preț estimativ în valută:
6288 6525$ 5256£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540439776
ISBN-10: 3540439773
Pagini: 220
Ilustrații: VIII, 212 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.31 kg
Ediția:2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Caracteristici

Includes supplementary material: sn.pub/extras