Reference Work Entry

Encyclopedia of Algorithms

pp 1-99

Implementation Challenge for Shortest Paths

2006; Demetrescu, Goldberg, Johnson
  • Camil DemetrescuAffiliated withDepartment of Information and Computer Systems, University of Roma
  • , Andrew V. GoldbergAffiliated withMicrosoft Research – Silicon Valley
  • , David S. JohnsonAffiliated withAlgorithms and Optimization Research Dept., AT&T Labs

Keywords and Synonyms

Test sets and experimental evaluation of computer programs for solving shortest path problems; DIMACS     

Problem Definition

DIMACS Implementation Challenges (http://​dimacs.​rutgers.​edu/​Challenges/​) are scientific events devoted to assessing the practical performance of algorithms in experimental settings, fostering effective technology transfer and establishing common benchmarks for fundamental computing problems. They are organized by DIMACS, the Center for Discrete Mathematics and Theoretical Computer Science. One of the main goals of DIMACS Implementation Challenges is to address questions of determining realistic algorithm performance where worst case analysis is overly pessimistic and probabilistic models are too unrealistic: experimentation can provide guides to realistic algorithm performance where analysis fails. Experimentation also brings algorithmic questio ...

This is an excerpt from the content