This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, 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 numerous exercises and references.
This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Number of pages: 660
Weight: 1178 g
Dimensions: 235 x 155 x 36 mm
Edition: 5th ed. 2012
From the reviews of the fifth edition:
"The book would be most suitable as a graduate text for a mathematics or computer science course. It offers a good number of exercises ... . This book excels at providing very up-to-date results that give an idea of the state of the art, but also makes it clear that this is still a very active area of research. Overall, it is a comprehensive and interesting text that manages to present both the most classical and the most recent ideas in the field." (Angele M. Hamel, ACM Computing Reviews, August, 2012)
"This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. ... `Combinatorial Optimization' can easily serve as ... complete reference for current research and is state-of-the-art. In this new edition references have been updated and new exercises were added." (Sebastian Pokutta, Zentralblatt MATH, Vol. 1237, 2012)
You may also be interested in...
Please sign in to write a review