Combinatorial Optimization: Algorithms and Complexity - Kenneth Steiglitz,Christos H. Papadimitriou
-25% koodilla BOOKS
Toimitus 31-37 arkipäivässä
30 päivän palautusoikeus
Clearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly. 19 ... Täydellinen kuvaus
Kuvaus
Clearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly. 1982 edition.
Lisätietoja
| Kirjoittaja | Kenneth Steiglitz, Christos H. Papadimitriou |
|---|---|
| Julkaisija | Dover Publications Inc. |
| Julkaisuvuosi | 2000 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9780486402581 |