Algorithm Engineering and Experimentation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540425601, 9783540448082

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Experimental Results on Statistical Approaches to Page Replacement Policies

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_5 ◽

2001 ◽

pp. 61-77

Author(s):

Vitus Leung ◽

Sandy Irani

Keyword(s):

Experimental Results ◽

Statistical Approaches

Download Full-text

Network Tomography through End-to-End Measurements

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_4 ◽

2001 ◽

pp. 60-60 ◽

Cited By ~ 2

Author(s):

Don Towsley

Keyword(s):

Network Tomography ◽

End To End

Download Full-text

New Algorithmic Challenges Arising in Measurement-Driven Networking Research

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_11 ◽

2001 ◽

pp. 145-146

Author(s):

Walter Willinger

Download Full-text

Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_1 ◽

2001 ◽

pp. 1-16 ◽

Cited By ~ 2

Author(s):

Sándor P. Fekete ◽

Henk Meijer ◽

André Rohe ◽

Walter Tietze

Keyword(s):

Traveling Salesman ◽

Hard Problem ◽

Traveling Salesman Problems

Download Full-text

The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_3 ◽

2001 ◽

pp. 32-59 ◽

Cited By ~ 49

Author(s):

Jill Cirasella ◽

David S. Johnson ◽

Lyle A. McGeoch ◽

Weixiong Zhang

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman ◽

Asymmetric Traveling Salesman Problem

Download Full-text

An Empirical Study of a New Approach to Nearest Neighbor Searching

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_14 ◽

2001 ◽

pp. 172-187 ◽

Cited By ~ 2

Author(s):

Songrit Maneewongvatana ◽

David M. Mount

Keyword(s):

Empirical Study ◽

Nearest Neighbor ◽

New Approach ◽

Nearest Neighbor Searching

Download Full-text

PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_8 ◽

2001 ◽

pp. 105-116 ◽

Cited By ~ 1

Author(s):

Saurabh Sethia ◽

Martin Held ◽

Joseph S. B. Mitchell

Keyword(s):

Voronoi Diagrams

Download Full-text

Experiments on Adaptive Set Intersections for Text Retrieval Systems

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_7 ◽

2001 ◽

pp. 91-104 ◽

Cited By ~ 17

Author(s):

Erik D. Demaine ◽

Alejandro López-Ortiz ◽

J. Ian Munro

Keyword(s):

Text Retrieval ◽

Retrieval Systems

Download Full-text

Implementation of a PTAS for Scheduling with Release Dates

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_17 ◽

2001 ◽

pp. 202-215

Author(s):

Clint Hepner ◽

Cliff Stein

Keyword(s):

Release Dates

Download Full-text

A Probabilistic Spell for the Curse of Dimensionality

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science ◽

10.1007/3-540-44808-x_12 ◽

2001 ◽

pp. 147-160 ◽

Cited By ~ 25

Author(s):

Edgar Chávez ◽

Gonzalo Navarro

Keyword(s):

Curse Of Dimensionality

Download Full-text

Algorithm Engineering and Experimentation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Experimental Results on Statistical Approaches to Page Replacement Policies

Network Tomography through End-to-End Measurements

New Algorithmic Challenges Arising in Measurement-Driven Networking Research

Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests

An Empirical Study of a New Approach to Nearest Neighbor Searching

PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets

Experiments on Adaptive Set Intersections for Text Retrieval Systems

Implementation of a PTAS for Scheduling with Release Dates

A Probabilistic Spell for the Curse of Dimensionality

Algorithm Engineering and Experimentation - Lecture Notes in Computer Science
Latest Publications