IMPORTANT MESSAGE: We are relocating warehouses on Tuesday, 4th April. Our last orders will be dispatched on Monday, 3rd April and we will resume dispatch on Thursday, 6th April. Back-Orders and Express Orders may be delayed if ordered during this period. If you are unsure regarding your order, please send us an email on: firstname.lastname@example.org and we will get back to you as soon as possible
Combinatorial Optimization: Algorithms and Complexity
Dover Publications Inc.
Christos H. Papadimitriou
Publication Date :
1 Jan 2000
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.