Verwandte Artikel zu The Shortest Path Problem: Ninth Dimacs Implementation...
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.
Suchergebnisse für The Shortest Path Problem: Ninth Dimacs Implementation...
Beispielbild für diese ISBN
The Shortest Path Problem Ninth DIMACS Implementation Challenge
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 319 pages. 10.24x7.24x0.87 inches. In Stock. Bestandsnummer des Verkäufers __0821843834
Neu kaufen
EUR 128,88
EUR 14,60 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
The Shortest Path Problem
Verlag:
American Mathematical Society, US, 2009
ISBN 10: 0821843834
ISBN 13: 9780821843833
Neu
Hardcover
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: New. 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. Bestandsnummer des Verkäufers LU-9780821843833
Neu kaufen
EUR 143,72
Versand gratis
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
The Shortest Path Problem: Ninth Dimacs Implementation Challenge
Verlag:
American Mathematical Society, 2009
ISBN 10: 0821843834
ISBN 13: 9780821843833
Neu
Hardcover
Anbieter: Kennys Bookstore, Olney, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title 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. Editor(s): Demetrescu, Camil; Goldberg, Andrew V.; Johnson, David S. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 319 pages, Illustrations 1 map, BIC Classification: PBD; PBV. Category: (UP) Postgraduate, Research & Scholarly. Weight in Grams: 756. . 2009. hardcover. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9780821843833
Neu kaufen
EUR 186,67
EUR 8,99 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Foto des Verkäufers
The Shortest Path Problem
Verlag:
American Mathematical Society, US, 2009
ISBN 10: 0821843834
ISBN 13: 9780821843833
Neu
Hardcover
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: New. 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. Bestandsnummer des Verkäufers LU-9780821843833
Neu kaufen
EUR 137,14
EUR 75,90 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
The Shortest Path Problem: Ninth Dimacs Implementation Challenge
Verlag:
American Mathematical Society, 2009
ISBN 10: 0821843834
ISBN 13: 9780821843833
Neu
Hardcover
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title 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. Editor(s): Demetrescu, Camil; Goldberg, Andrew V.; Johnson, David S. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 319 pages, Illustrations 1 map, BIC Classification: PBD; PBV. Category: (UP) Postgraduate, Research & Scholarly. Weight in Grams: 756. . 2009. hardcover. . . . . Bestandsnummer des Verkäufers V9780821843833
Neu kaufen
EUR 217,43
EUR 9,50 Versand
Versand von Irland nach USA
Versand von Irland nach USA
Anzahl: 1 verfügbar