Recomienda este artículo a tus amigos:
The Shortest Path Problem: Ninth DIMACS Implementation Challenge - DIMACS: Series in Discrete Mathematics and Theoretical Computer Science American Mathematical Society New Ed. edition
The Shortest Path Problem: Ninth DIMACS Implementation Challenge - DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
American Mathematical Society
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 todoMere med samme udgiver
Ver todo de American Mathematical Society ( Ej. Hardcover Book , Paperback Book y Book )