The Shortest Path Problem: Ninth DIMACS Implementation Challenge - DIMACS: Series in Discrete Mathematics and Theoretical Computer Science - American Mathematical Society - Grāmatas - American Mathematical Society - 9780821843833 - 2009. gada 30. augusts
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

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

Saņemt e-pastu, kad prece būs pieejama
Do you have a profile? Pierakstīties
Saņemiet paziņojumus par jauniem American Mathematical Society izdevumiem

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

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,

Mediji Grāmatas     Hardcover Book   (Grāmata ar cieto muguriņu un vāku)
Izlaists 2009. gada 30. augusts
ISBN13 9780821843833
Izdevēji American Mathematical Society
Lapas 319
Izmēri 150 × 220 × 20 mm   ·   756 g
Redaktors Demetrescu, Camil
Redaktors Goldberg, Andrew V.
Redaktors Johnson, David S.

Vairāk no American Mathematical Society

Rādīt visu

Vairāk no tā paša izdevēja

Skatīt visus American Mathematical Society