Author | ALENEX 2001 (2001 : Washington, D.C.) |
---|---|
Title | Algorithm engineering and experimentation : third international workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001 : revised papers / Adam L. Buchsbaum, Jack Snoeyink (eds.) |
Imprint | Berlin : Springer, c2001 |
Descript | viii, 229 p. : ill. ; 24 cm |
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP -- Asymmetric Traveling Salesman Problem -- Network Tomography through End-to-End Measurements -- Estimating Resemblance of MIDI Documents -- PVD: A Stable Implementation for Computing Voronoi Diagrams -- Hierarchical Clustering of Trees -- Travel Planning with Self-Made Maps -- Empirical Study of a New Approach to Nearest Neighbor Searching -- 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
LOCATION | CALL# | STATUS |
---|---|---|
Central Library (4th Floor) | 005.1 A368A | CHECK SHELVES |