Combinatorial Optimization :Theory and Algorithms - Algorithms and Combinatorics

4.33 ( 12 Ratings by Goodreads)
Combinatorial Optimization

Combinatorial Optimization :Theory and Algorithms - Algorithms and Combinatorics

4.33 (12 Ratings by Goodreads)
paperback
Published: 11 January, 2019
Standard worldwide delivery by Tue, June 30 - Thu, July 9
Order within 0
Condition: NEW
$74.07
Price includes shipping
Available 20+ in stock
- +
FREE Returns within 30 days

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 sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.

See more

More Details

Type Book
ISBN13 9783662585665
ISBN10 3662585669
Number Of Pages 698
Item Weight 1000 g
Publisher / Reseller Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Format paperback
Edition Sixth Edition 2018
See More +

GoodReads Reviews

Author's Bio

Bernhard Korte is professor of operations research and director of the Research Institute for Discrete Mathematics at the University of Bonn. He founded the Arithmeum in Bonn and received numerous awards, including a honorary doctoral degree and the "Staatspreis NRW". His research interests include combinatorial optimization and chip design.

Jens Vygen is professor of discrete mathematics at the University of Bonn and principal investigator of the Hausdorff Center for Mathematics. He also co-authored the textbook “Algorithmic Mathematics” and has served as editor of several books and journals. His research interests include combinatorial optimization and algorithms for chip design.

Show more