Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
A rigorous graduate text covering the theory and algorithms of combinatorial optimization, including matching, flows, matroids, and approximation methods.
About This Book
This book presents the mathematical foundations and algorithmic techniques of combinatorial optimization.
It covers classical problems such as matching, flows, and matroids along with modern approximation methods.
The text emphasizes both theoretical results and practical algorithm design.
Intended for graduate students and researchers in mathematics and computer science.
Reviews
No reviews yet. Be the first to review this book!