Coupon
Combinatorial Optimization : Algorithms and Complexity
by Christos H. Papadimitriou and Kenneth Steiglitz


Overview - This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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.  Read more...

 
eBook

Retail Price: $21.95
$14.41

(Save 34%)

Download

Language: English

This item is only available to U.S. and Canada billing addresses.

 
 
In Stock Online.

FREE Shipping for Club Members
Not a member? Join Today!

 
 
 
 

More About Combinatorial Optimization by Christos H. Papadimitriou; Kenneth Steiglitz
 
 
 
Overview
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly.


This item is Non-Returnable.

 
Details
  • ISBN: 9780486320137
  • Publisher: Dover Publications
  • Date: Sept 2013
 
Customer Reviews