Combinatorial Optimization
Algorithms and Complexity
AvChristos H. Papadimitriou,Kenneth Steiglitz
Häftad, Engelska, 2000
Del i serien Dover Books on Computer Science
299 kr
Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.
Beskrivning
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.
Produktinformation
Utforska kategorier
Betyg & recensioner
4/5
Betyg & recensioner
4/5
Hoppa över listan
Mer från samma författare
Kurt Gödel and the Foundations of Mathematics
Matthias Baaz, Christos H. Papadimitriou, Hilary W. Putnam, Dana S. Scott, Charles L. Harper, Jr
Inbunden
1 630 kr
Kurt Gödel and the Foundations of Mathematics
Matthias Baaz, Christos H. Papadimitriou, Hilary W. Putnam, Dana S. Scott, Charles L. Harper, Jr
Häftad
821 kr
