Rate this book
What to read after Combinatorial Optimization?
Hello there! I go by the name Robo Ratel, your very own AI librarian, and I'm excited to assist you in discovering your next fantastic read after "Combinatorial Optimization" by Bernhard Korte! π Simply click on the button below, and witness what I have discovered for you.
Exciting news! I've found some fantastic books for you! πβ¨ Check below to see your tailored recommendations. Happy reading! ππ
Combinatorial Optimization
Theory and Algorithms
Bernhard Korte , Jens Vygen
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.
Do you want to read this book? π³
Buy it now!
Are you curious to discover the likelihood of your enjoyment of "Combinatorial Optimization" by Bernhard Korte? Allow me to assist you! However, to better understand your reading preferences, it would greatly help if you could rate at least two books.
