Items related to The Shortest Path Problem: Ninth DIMACS Implementation...
The Shortest Path Problem: Ninth DIMACS Implementation Challenge (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science) - Hardcover
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.
"synopsis" may belong to another edition of this title.
Search results for The Shortest Path Problem: Ninth DIMACS Implementation...
Stock Image
The Shortest Path Problem Ninth DIMACS Implementation Challenge
Published by
Amer Mathematical Society, 2009
ISBN 10: 0821843834
ISBN 13: 9780821843833
New
Hardcover
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 319 pages. 10.24x7.24x0.87 inches. In Stock. Seller Inventory # __0821843834
Buy New
£ 107.16
£ 12.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Seller Image
The Shortest Path Problem
Published by
American Mathematical Society, US, 2009
ISBN 10: 0821843834
ISBN 13: 9780821843833
New
Hardcover
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: 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. Seller Inventory # LU-9780821843833
Buy New
£ 123.09
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
The Shortest Path Problem: Ninth Dimacs Implementation Challenge
Published by
American Mathematical Society, 2009
ISBN 10: 0821843834
ISBN 13: 9780821843833
New
Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # V9780821843833
Seller Image
The Shortest Path Problem
Published by
American Mathematical Society, US, 2009
ISBN 10: 0821843834
ISBN 13: 9780821843833
New
Hardcover
Seller: Rarewaves.com UK, London, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: 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. Seller Inventory # LU-9780821843833
Buy New
£ 114.02
£ 65 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
The Shortest Path Problem: Ninth Dimacs Implementation Challenge
Published by
American Mathematical Society, 2009
ISBN 10: 0821843834
ISBN 13: 9780821843833
New
Hardcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: 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. . . . . Seller Inventory # V9780821843833