Skip to content

Opening book details…

Can I read Combinatorial Optimization: Algorithms and Complexity 1 on EtoBox?

Combinatorial Optimization: Algorithms and Complexity 1 by Christos H. Papadimitriou, Kenneth Steiglitz is a nonfiction available to read on EtoBox.

What is Combinatorial Optimization: Algorithms and Complexity 1 about?

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.

Who reads Combinatorial Optimization: Algorithms and Complexity 1?

It is typically read by self-directed learners exploring a subject in depth.

Common subject areas: history, science, philosophy, social sciences.

Author
Christos H. Papadimitriou, Kenneth Steiglitz
Publisher
Prentice Hall
Published
1998
Language
EN
ISBN
9780131524620
Category
nonfiction
Subjects
Mathematics, Optimization. Operations Research, 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