Combinatorial Optimization: Algorithms and Complexity - Kenneth Steiglitz,Christos H. Papadimitriou
-25% ar kodu BOOKS
Piegāde 31-37 darba dienu laikā
30 dienu atgriešanas politika
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 ... Pilns apraksts
Aprašymas
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.
Vairāk informācijas
| Autors | Kenneth Steiglitz, Christos H. Papadimitriou |
|---|---|
| Izdevējs | Dover Publications Inc. |
| Izlaides gads | 2000 |
| Vāka tips | Mīkstais vāks |
| EAN | 9780486402581 |