+612 9045 4394
 
CHECKOUT
Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, January 5-6, 2001 Revised Papers :  Third International Workshop, ALENEX 2001, Washington, DC, January 5-6, 2001 Revised Papers - Adam L. Buchsbaum

Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, January 5-6, 2001 Revised Papers

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

By: Adam L. Buchsbaum (Editor), Jack Snoeyink (Editor)

Paperback Published: January 2001
ISBN: 9783540425601
Number Of Pages: 236

Share This Book:

Paperback

$125.05
or 4 easy payments of $31.26 with Learn more
Ships in 5 to 9 business days

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.

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problemsp. 1
CNOP - A Package for Constrained Network Optimizationp. 17
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Testsp. 32
Network Tomography through End-to-End Measurementsp. 60
Experimental Results on Statistical Approaches to Page Replacement Policiesp. 61
Estimating Resemblance of MIDI Documentsp. 78
Experiments on Adaptive Set Intersections for Text Retrieval Systemsp. 91
PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pocketsp. 105
Hierarchical Clustering of Trees: Algorithms and Experimentsp. 117
Travel Planning with Self-Made Mapsp. 132
New Algorithmic Challenges Arising in Measurement-Driven Networking Researchp. 145
A Probabilistic Spell for the Curse of Dimensionalityp. 147
Experimental Evaluation of the Height of a Random Set of Points in a d-dimensional Cubep. 161
An Empirical Study of a New Approach to Nearest Neighbor Searchingp. 172
Spectral Analysis for Data Miningp. 188
Trade Off Between Compression and Search Times in Compact Suffix Arrayp. 189
Implementation of a PTAS for Scheduling with Release Datesp. 202
Biased Skip Lists for Highly Skewed Access Patternsp. 216
Author Indexp. 231
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540425601
ISBN-10: 3540425608
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 236
Published: January 2001
Publisher: SPRINGER VERLAG GMBH
Country of Publication: US
Dimensions (cm): 23.39 x 15.6  x 1.3
Weight (kg): 0.35