• Tot 10% korting
  • Ook 2e hands studieboeken
  • Gratis verzending

Combinatorial Optimization

Korte, Bernhard,
ISBN/EAN 9783662560389
Druk 6
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.
€ 82,54
€ 91,71
Vandaag besteld, 03-10 bezorgd
Aantal
Compleet
Alles voor jouw opleiding
24/7 op de hoogte
Volg je bestelling in Mijn Studystore
Op tijd
Bij je thuisbezorgd