Abstract is missing.
- Solving a Hard Problem to Approximate an Easy One: Heuristics for Maximum Matchings and Maximum Traveling Salesman ProblemsSándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze. 1-16 [doi]
- CNOP - A Package for Constrained Network OptimizationKurt Mehlhorn, Mark Ziegelmann. 17-31 [doi]
- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and TestsJill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang. 32-59 [doi]
- Network Tomography through End-to-End MeasurementsDonald F. Towsley. 60 [doi]
- Experimental Results on Statistical Approaches to Page Replacement PoliciesVitus J. Leung, Sandy Irani. 61-77 [doi]
- Estimating Resemblance of MIDI DocumentsMichael Mitzenmacher, Sean Owen. 78-90 [doi]
- Experiments on Adaptive Set Intersections for Text Retrieval SystemsErik D. Demaine, Alejandro López-Ortiz, J. Ian Munro. 91-104 [doi]
- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal PocketsSaurabh Sethia, Martin Held, Joseph S. B. Mitchell. 105-116 [doi]
- Hierarchical Clustering of Trees: Algorithms and ExperimentsIrene Finocchi, Rossella Petreschi. 117-131 [doi]
- Travel Planning with Self-Made MapsUlrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm. 132-144 [doi]
- New Algorithmic Challenges Arising in Measurement-Driven Networking ResearchWalter Willinger. 145-146 [doi]
- A Probabilistic Spell for the Curse of DimensionalityEdgar Chávez, Gonzalo Navarro. 147-160 [doi]
- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional CubeEric Breimer, Mark K. Goldberg, Brian Kolstad, Malik Magdon-Ismail. 161-171 [doi]
- An Empirical Study of a New Approach to Nearest Neighbor SearchingSongrit Maneewongvatana, David M. Mount. 172-187 [doi]
- Spectral Analysis for Data MiningAnna R. Karlin. 188 [doi]
- Trade Off Between Compression and Search Times in Compact Suffix ArrayVeli Mäkinen. 189-201 [doi]
- Implementation of a PTAS for Scheduling with Release DatesClint Hepner, Clifford Stein. 202-215 [doi]
- Biased Skip Lists for Highly Skewed Access PatternsFunda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha. 216-230 [doi]