Skip to content

Opening book details…

Can I read Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) on EtoBox?

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) by Christos H. Papadimitriou; Kenneth Steiglitz is a reference work available to read on EtoBox.

What is Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) about?

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.

Who reads Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)?

It is typically read by readers who need quick, reliable lookup and repeat reference.

Common subject areas: reference, language, dictionaries and manuals.

Author
Christos H. Papadimitriou; Kenneth Steiglitz
Publisher
Dover Publications, Incorporated
Published
2013
Language
EN
ISBN
9780486402581
Category
reference
Subjects
Reference, Mathematics, Stem
Rating
3.98 / 5 (81 ratings)
Updated
2026-03-14

Other editions & translations

More by Christos H. Papadimitriou; Kenneth Steiglitz

Browse all works by Christos H. Papadimitriou; Kenneth Steiglitz

Similar books