Reference Work Entry

Encyclopedia of Algorithms

pp 947-951

Date:

Implementation Challenge for Shortest Paths

  • Camil DemetrescuAffiliated withDepartment of Computer and Systems Science, University of RomeDepartment of Information and Computer Systems, University of Rome Email author 
  • , Andrew V. GoldbergAffiliated withMicrosoft Research – Silicon Valley
  • , David S. JohnsonAffiliated withDepartment of Computer Science, Columbia UniversityAT&T Laboratories, Algorithms and Optimization Research Department

Keywords

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

Years and Authors of Summarized Original Work

  • 2006; Demetrescu, Goldberg, Johnson

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 questions closer to the original problems that motivated theoretical work. It also tests many assumptions about implementation methods and data structures ...

This is an excerpt from the content