Combinatorial Optimization: Theory and Algorithms

Korte, Bernhard; Vygen, Jens

ISBN 10: 3642244874 / ISBN 13: 9783642244872

Edité par Springer, 2012

Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 2.45. N° de réf. du vendeur G3642244874I3N00

Synopsis :

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.

Détails bibliographiques

Titre : Combinatorial Optimization: Theory and ...
Éditeur : Springer
Date d'édition : 2012
Reliure : Hardcover
Etat : Good
Etat de la jaquette : No Jacket
Edition : 5ème Édition