28%OFF
Stock image for illustration purposes only - book cover, edition or condition may vary.
Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou
€ 33.99
€ 24.37
FREE Delivery in Ireland
Description for Combinatorial Optimization: Algorithms and Complexity
Paperback. Series: Dover Books on Computer Science. Num Pages: 528 pages. BIC Classification: PBU; PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 214 x 136 x 26. Weight in Grams: 600. Algorithms and Complexity. 528 pages. Cateogry: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. BIC Classification: PBU; PBV. Dimension: 214 x 136 x 26. Weight: 542.
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.
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.
Product Details
Publisher
Dover Publications Inc.
Format
Paperback
Publication date
2000
Series
Dover Books on Computer Science
Condition
New
Number of Pages
528
Place of Publication
, United States
ISBN
9780486402581
SKU
V9780486402581
Shipping Time
Usually ships in 4 to 8 working days
Ref
99-2
Reviews for Combinatorial Optimization: Algorithms and Complexity