The Shortest Path Problem: Ninth DIMACS Implementation Challenge - DIMACS: Series in Discrete Mathematics and Theoretical Computer Science - American Mathematical Society - Libros - American Mathematical Society - 9780821843833 - 30 de agosto de 2009
En caso de que portada y título no coincidan, el título será el correcto

The Shortest Path Problem: Ninth DIMACS Implementation Challenge - DIMACS: Series in Discrete Mathematics and Theoretical Computer Science New Ed. edition


Recibe un correo electrónico cuando el artículo esté disponible
¿Tienes un perfil? Iniciar sesión
Añadir a tu lista de deseos de iMusic

Aún no valorado

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.


319 pages, Illustrations 1 map,

Medios de comunicación Libros     Hardcover Book   (Libro con lomo y cubierta duros)
Publicado 30 de agosto de 2009
ISBN13 9780821843833
Editores American Mathematical Society
Páginas 319
Dimensiones 150 × 220 × 20 mm   ·   756 g
Editor Demetrescu, Camil
Editor Goldberg, Andrew V.
Editor Johnson, David S.

Mas por American Mathematical Society

Mostrar todo

Mere med samme udgiver