Combinatorial Optimization : Theory and Algorithms PDF

by Bernhard Korte, Jens Vygen

Part of the Algorithms and Combinatorics series

PDF

Download - Immediately Available

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

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

Information

Download - Immediately Available
Format:PDF
Publisher:Springer Berlin Heidelberg
Publication Date:10/01/2012
Category:
ISBN:9783642244889

Other Formats

PDF from £33.99
- PDF | Published 11/11/2013 | £61.20 | View now
- PDF | Published 29/06/2013 | £61.20 | View now
- PDF | Published 04/11/2007 | £59.49 | View now
- PDF | Published 27/01/2006 | £33.99 | View now
Paperback / softback from £69.99
- Paperback / softback | Published 11/11/2010 | £69.99 | View now
Hardback from £57.89
- Hardback | Published 23/03/2018 | £57.89 | View now