Format:
Online-Ressource
ISBN:
9783540456438
,
3540439773
Series Statement:
Lecture Notes in Computer Science 2409
Content:
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.
Note:
Lizenzpflichtig
Additional Edition:
ISBN 9783540439776
Additional Edition:
Buchausg. u.d.T. Algorithm engineering and experiments Berlin : Springer, 2002 ISBN 3540439773
Language:
English
Subjects:
Computer Science
Keywords:
Algorithmus
;
Datenstruktur
;
Algorithmus
;
Datenstruktur
;
Konferenzschrift
DOI:
10.1007/3-540-45643-0
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Bookmarklink