num_pages: 660
description: This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics mostly at graduate level. This book reviews the fundamentals covers the classical topics (paths flows matching matroids NP-completeness approximation algorithms) in detail and proceeds to advanced and recent topics some of which have not appeared in a textbook before. Throughout it contains complete but concise proofs and also provides numerousexercises and references.This fifth edition has again been updated revised and significantlyextended with more than 60 new exercises and new material on varioustopics including Cayley's formula blocking flows fasterb-matching separation multidimensional knapsack multicommoditymax-flow min-cut ratio and sparsest cut. Thus this book represents the state of the art of combinatorial optimization.
language: English
title: Combinatorial Optimization: Theory and Algorithms
publisher: Springer