Rollover to Zoom 

Description

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.

  • ISBN13: 9783642244872
  • Publisher: Springer
  • Pubilcation Year: 2012
  • Format: Hardcover
  • Pages: 00659
Specifications
FormatPaperback
SeriesAlgorithms and Combinatorics
Series Volume Number21
Publication DateJanuary 13, 2012

Combinatorial Optimization: Theory and Algorithms

Write a Review
0
This item is unavailable right now.Telling you that an item is out of stock is basically the last thing we wanted to do. We're sorry.Sad Face