Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)

Korte, Bernhard

ISBN 10: 3662560380 / ISBN 13: 9783662560389

Published by Springer, 2018

About this Item

Readable, but has significant damage / tears. Has a remainder mark. hardcover Used - Acceptable 2018.

Seller Inventory # AB-012859

Bibliographic Details

• Title: Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
• Publisher: Springer
• Publication Date: 2018
• Language: English
• ISBN 10: 3662560380
• ISBN 13: 9783662560389
• Binding: Hardcover
• Condition: Acceptable
• Weight: 40.81 ounces

About this title

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 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.

About the Author

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.