The Shortest Path Problem: Ninth Dimacs Implementation Challenge (DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 74, Band 74) - Hardcover

Inhaltsangabe

The latest mustering of scientists with the intention of further narrowing the gap between theory and practice for algorithms in specific problem areas was held at Rutgers University, in New Jersey, during November 2006, and focused on shortest path algorithms. Shortest-path problems have been addressed by mathematicians and geometers since the 1950s, and continue to be relevant in such areas as delivery, traffic information, software design, and database design. The 12 papers explore such topics as fast point-to-point shortest path computations with arc-flags, highway hierarchies star, ultrafast shortest-path queries through transit nodes, parallel shortest-path algorithms for solving large-scale instances, and engineering labor-constrained shortest-path algorithms. Annotation ©2009 Book News, Inc., Portland, OR (booknews.com)

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.