Combinatorial Optimization - Algorithms and Complexity
Av Christos H. Papadimitriou, del av serien
Dover Books on Computer Science
Pocket
2000
Engelsk
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.
Ikke tilgjengelig for Klikk&Hent
På nettlager (bestilles fra England. Leveres normalt innen 2 uker)
- Bytt i alle våre butikker
- Klikk og hent