Combinatorial Optimization: Algorithms and Complexity New edition

Combinatorial Optimization: Algorithms and Complexity New edition book cover

Combinatorial Optimization: Algorithms and Complexity New edition

Author(s): Christos H. Papadimitriou (Author), Kenneth Steiglitz (Author)

  • Publisher: Dover Publications Inc
  • Publication Date: 1 Feb. 2000
  • Edition: New edition
  • Language: English
  • Print length: 528 pages
  • ISBN-10: 0486402584
  • ISBN-13: 9780486402581

Book Description

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.

View on Amazon

电子书代发PDF格式价格30我要求助
未经允许不得转载:Wow! eBook » Combinatorial Optimization: Algorithms and Complexity New edition