Algorithm Engineering and Experimentation

Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers

244 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

ALENEX'01.- Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.- CNOP - A Package for Constrained Network Optimization.- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests.- Network Tomography through End-to-End Measurements.- Experimental Results on Statistical Approaches to Page Replacement Policies.- Estimating Resemblance of MIDI Documents.- Experiments on Adaptive Set Intersections for Text Retrieval Systems.- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets.- Hierarchical Clustering of Trees: Algorithms and Experiments.- Travel Planning with Self-Made Maps.- New Algorithmic Challenges Arising in Measurement-Driven Networking Research.- A Probabilistic Spell for the Curse of Dimensionality.- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube.- An Empirical Study of a New Approach to Nearest Neighbor Searching.- Spectral Analysis for Data Mining.- Trade Off Between Compression and Search Times in Compact Suffix Array.- Implementation of a PTAS for Scheduling with Release Dates.- Biased Skip Lists for Highly Skewed Access Patterns.

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Computerprogrammierung und Softwareentwicklung Grafikprogrammierung
• ISBN: 9783540425601
• Sprache: Englisch
• Erscheinungsdatum: 12.09.2001
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: Jack Snoeyink, Adam L. Buchsbaum