The Shortest Path Problem (DIMACS Series in Discrete Mathematics and Theoretical Computer Science)

and David S. Johnson Camil Demetrescu; Andrew V. Goldberg; Camil Demetrescu [Editor]; Andrew V. Goldberg [Editor]; Divid S. Johnson [Editor];

ISBN 10: 0821843834 / ISBN 13: 9780821843833

Published by American Mathematical Society, DIMACS, 2009

About this Item

American Mathematical Society; Providence, 2009. Hardcover. Volume 74. A Very Good, binding sturdy and intact, some handling/scuff marks to boards, slightly bumped bottom board corners, bit of crimping to spine edges, AMS compliments sticker affirmed to bottom front pastedown, without Dust wrapper. A nice and clean copy. 8vo[octavo or approx. 6 x 9 inches], 319pp., references. We pack securely and ship daily with delivery confirmation on every book. The picture on the listing page is of the actual book for sale. Additional Scan(s) are available for any item, please inquire.Please note: Oversized books/sets MAY require additional postage then what is quoted for 2.2lb book.

Seller Inventory # SKU1037465

Bibliographic Details

• Title: The Shortest Path Problem (DIMACS Series in Discrete Mathematics and Theoretical Computer Science)
• Publisher: American Mathematical Society, DIMACS
• Publication Date: 2009
• Language: English
• ISBN 10: 0821843834
• ISBN 13: 9780821843833
• Binding: hardcover
• Condition: Very Good
• Weight: 26 ounces
• Seller catalogs:
  • Math Text Books

About this title

Synopsis

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.