Submit an Enquiry or Call Us +44 (0) 1482 384660
Image for Combinatorial optimization  : theory and algorithms

Combinatorial optimization : theory and algorithms (Sixth edition)

By: Korte, Bernhard Vygen, Jens

Part of the Algorithms and Combinatorics series
3662560380 / 9783662560389
Usually dispatched within 4 weeks
24 cm xxi, 698 pages : illustrations (black and white)
Postgraduate, Research & Scholarly  Learn More
Previous edition: 2012.

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+e)-approximation for Steiner trees, and the VPN theorem.

Thus, this book continues to represent the state of the art of combinatorial optimization.


KJT Operational research, PBKQ Calculus of variations, PBV Combinatorics & graph theory, UYA Mathematical theory of computation

Our price£74.99
Other Formats