Algorithm Engineering and Experiments 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Mount, David M. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Stein, Clifford (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
• Έκδοση: 1st ed. 2002.
• Σειρά: Lecture Notes in Computer Science, 2409
• Θέματα: Computer programming.; Software engineering.; Algorithms.; Data structures (Computer science).; Computer graphics.; Computer science-Mathematics.; Programming Techniques.; Software Engineering/Programming and Operating Systems.; Algorithm Analysis and Problem Complexity.; Data Structures.; Computer Graphics.; Discrete Mathematics in Computer Science.

Πίνακας περιεχομένων:

• 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.