Algorithms and Combinatorics

Combinatorial Optimization

Theory and Algorithms

Authors: Korte, Bernhard, Vygen, Jens

  • Well-written, popular textbook on combinatorial optimization
  • One of very few textbooks on this topic
  • Subject area has manifold applications
  • Offers complete but concise proofs, making it an invaluable practical tool for students
  • Updated sixth edition
see more benefits

Buy this book

eBook 67,82 €
price for Spain (gross)
  • ISBN 978-3-662-56039-6
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 83,19 €
price for Spain (gross)
  • ISBN 978-3-662-56038-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this Textbook

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 to represent the state of the art of combinatorial optimization.

About the authors

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.

Table of contents (22 chapters)

Buy this book

eBook 67,82 €
price for Spain (gross)
  • ISBN 978-3-662-56039-6
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 83,19 €
price for Spain (gross)
  • ISBN 978-3-662-56038-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Combinatorial Optimization
Book Subtitle
Theory and Algorithms
Authors
Series Title
Algorithms and Combinatorics
Series Volume
21
Copyright
2018
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag GmbH Germany, part of Springer Nature
eBook ISBN
978-3-662-56039-6
DOI
10.1007/978-3-662-56039-6
Hardcover ISBN
978-3-662-56038-9
Series ISSN
0937-5511
Edition Number
6
Number of Pages
XXI, 698
Number of Illustrations and Tables
78 b/w illustrations
Topics