ALENEX 2001: Washington, DC, USA

@proceedings{DBLP:conf/alenex/2001,
  editor    = {Adam L. Buchsbaum and
               Jack Snoeyink},
  title     = {Algorithm Engineering and Experimentation, Third International
               Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001,
               Revised Papers},
  booktitle = {ALENEX},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2153},
  year      = {2001},
  isbn      = {3-540-42560-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze:
  Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. 1-16
  Electronic Edition (Springer LINK) BibTeX
• Kurt Mehlhorn, Mark Ziegelmann:
  CNOP - A Package for Constrained Network Optimization. 17-31
  Electronic Edition (Springer LINK) BibTeX
• Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang:
  The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. 32-59
  Electronic Edition (Springer LINK) BibTeX
• Donald F. Towsley:
  Network Tomography through End-to-End Measurements. 60
  Electronic Edition (Springer LINK) BibTeX
• Vitus J. Leung, Sandy Irani:
  Experimental Results on Statistical Approaches to Page Replacement Policies. 61-77
  Electronic Edition (Springer LINK) BibTeX
• Michael Mitzenmacher, Sean Owen:
  Estimating Resemblance of MIDI Documents. 78-90
  Electronic Edition (Springer LINK) BibTeX
• Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
  Experiments on Adaptive Set Intersections for Text Retrieval Systems. 91-104
  Electronic Edition (Springer LINK) BibTeX
• Saurabh Sethia, Martin Held, Joseph S. B. Mitchell:
  PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets. 105-116
  Electronic Edition (Springer LINK) BibTeX
• Irene Finocchi, Rossella Petreschi:
  Hierarchical Clustering of Trees: Algorithms and Experiments. 117-131
  Electronic Edition (Springer LINK) BibTeX
• Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
  Travel Planning with Self-Made Maps. 132-144
  Electronic Edition (Springer LINK) BibTeX
• Walter Willinger:
  New Algorithmic Challenges Arising in Measurement-Driven Networking Research. 145-146
  Electronic Edition (Springer LINK) BibTeX
• Edgar Chávez, Gonzalo Navarro:
  A Probabilistic Spell for the Curse of Dimensionality. 147-160
  Electronic Edition (Springer LINK) BibTeX
• Eric Breimer, Mark K. Goldberg, Brian Kolstad, Malik Magdon-Ismail:
  Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube. 161-171
  Electronic Edition (Springer LINK) BibTeX
• Songrit Maneewongvatana, David M. Mount:
  An Empirical Study of a New Approach to Nearest Neighbor Searching. 172-187
  Electronic Edition (Springer LINK) BibTeX
• Anna R. Karlin:
  Spectral Analysis for Data Mining. 188
  Electronic Edition (Springer LINK) BibTeX
• Veli Mäkinen:
  Trade Off Between Compression and Search Times in Compact Suffix Array. 189-201
  Electronic Edition (Springer LINK) BibTeX
• Clint Hepner, Clifford Stein:
  Implementation of a PTAS for Scheduling with Release Dates. 202-215
  Electronic Edition (Springer LINK) BibTeX
• Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha:
  Biased Skip Lists for Highly Skewed Access Patterns. 216-230
  Electronic Edition (Springer LINK) BibTeX