Pub. Date:
American Mathematical Society
Shortest Path Problem: Ninth DIMACS Implementation Challenge

Shortest Path Problem: Ninth DIMACS Implementation Challenge


Current price is , Original price is $117.0. You

Temporarily Out of Stock Online

Please check back later for updated availability.

This item is available online through Marketplace sellers.


Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950's and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings.

Product Details

ISBN-13: 9780821843833
Publisher: American Mathematical Society
Publication date: 07/28/2009
Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science Ser. , #74
Edition description: New Edition
Pages: 319
Product dimensions: 7.20(w) x 10.20(h) x 0.90(d)

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews