Algorithm Engineering and Experimentation: Third International Workshop, ALENEX 2001 Washington, DC, USA, January 5–6, 2001 Revised Papers
Author: Adam L. Buchsbaum, Jack Snoeyink
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42560-1
DOI: 10.1007/3-540-44808-X

Table of Contents:

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

This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Algorithm Engineering and Experimentation, ALENEX 2001, held in Washington, DC, USA in January 2001. The 15 revised full papers presented together with the abstracts of three invited presentations have gone through two rounds of reviewing and revision and were selected from 31 submissions. Among the topics addressed are heuristics for approximation, network optimization, TSP, randomization, sorting, information retrieval, graph computations, tree clustering, scheduling, network algorithms, point set computations, searching, and data mining
Mode of access: World Wide Web