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 fifth edition
see more benefits

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-642-24488-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $89.95
price for USA
  • ISBN 978-3-642-24487-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $89.95
price for USA
  • ISBN 978-3-642-42767-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
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 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.

Reviews

From the reviews of the fifth edition:

“The book would be most suitable as a graduate text for a mathematics or computer science course. It offers a good number of exercises … . This book excels at providing very up-to-date results that give an idea of the state of the art, but also makes it clear that this is still a very active area of research. Overall, it is a comprehensive and interesting text that manages to present both the most classical and the most recent ideas in the field.” (Angele M. Hamel, ACM Computing Reviews, August, 2012)

“This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way.  … ‘Combinatorial Optimization’ can easily serve as … complete reference for current research and is state-of-the-art. In this new edition references have been updated and new exercises were added.” (Sebastian Pokutta, Zentralblatt MATH, Vol. 1237, 2012)


Table of contents (22 chapters)

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-642-24488-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $89.95
price for USA
  • ISBN 978-3-642-24487-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $89.95
price for USA
  • ISBN 978-3-642-42767-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
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
2012
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-24488-9
DOI
10.1007/978-3-642-24488-9
Hardcover ISBN
978-3-642-24487-2
Softcover ISBN
978-3-642-42767-1
Series ISSN
0937-5511
Edition Number
5
Number of Pages
XX, 660
Topics