default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDALENEX 2001: Washington, DC, USA
- Adam L. Buchsbaum, Jack Snoeyink:
Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers. Lecture Notes in Computer Science 2153, Springer 2001, ISBN 3-540-42560-8 - 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 - Kurt Mehlhorn, Mark Ziegelmann:
CNOP - A Package for Constrained Network Optimization. 17-31 - Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang
:
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. 32-59 - Donald F. Towsley:
Network Tomography through End-to-End Measurements. 60 - Vitus J. Leung, Sandy Irani:
Experimental Results on Statistical Approaches to Page Replacement Policies. 61-77 - Michael Mitzenmacher, Sean Owen:
Estimating Resemblance of MIDI Documents. 78-90 - Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Experiments on Adaptive Set Intersections for Text Retrieval Systems. 91-104 - Saurabh Sethia, Martin Held, Joseph S. B. Mitchell:
PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets. 105-116 - Irene Finocchi, Rossella Petreschi:
Hierarchical Clustering of Trees: Algorithms and Experiments. 117-131 - Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Travel Planning with Self-Made Maps. 132-144 - Walter Willinger:
New Algorithmic Challenges Arising in Measurement-Driven Networking Research. 145-146 - Edgar Chávez, Gonzalo Navarro:
A Probabilistic Spell for the Curse of Dimensionality. 147-160 - 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 - Songrit Maneewongvatana, David M. Mount:
An Empirical Study of a New Approach to Nearest Neighbor Searching. 172-187 - Anna R. Karlin:
Spectral Analysis for Data Mining. 188 - Veli Mäkinen:
Trade Off Between Compression and Search Times in Compact Suffix Array. 189-201 - Clint Hepner, Clifford Stein:
Implementation of a PTAS for Scheduling with Release Dates. 202-215 - Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha:
Biased Skip Lists for Highly Skewed Access Patterns. 216-230
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-27 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
