Shortest path problem ninth (3 risultati)
The Shortest Path Problem Ninth DIMACS Implementation Challenge
Demetrescu, Camil (Editor)/ Goldberg, Andrew V. (Editor)/ Johnson, Divid S. (Editor)
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 130,21
EUR 14,75 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 319 pages. 10.24x7.24x0.87 inches. In Stock.
The Shortest Path Problem: Ninth Dimacs Implementation Challenge
. Ed(s): Demetrescu, Camil; Goldberg, Andrew V.; Johnson, David S.
- Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 194,70
EUR 9,37 spedizioneSpedito in U.S.A.Quantità: 1 disponibile
Condizione: 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.…
The Shortest Path Problem: Ninth Dimacs Implementation Challenge
. Ed(s): Demetrescu, Camil; Goldberg, Andrew V.; Johnson, David S.
- Rilegato
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 217,43
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 1 disponibile
Condizione: 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. . . . .…
