000			01821nam a22002415i 4500
999			_c34175 _d34175
010			_a 2017958030
020			_a9783662560389
082			_a519.64 CO MB
245	0	0	_aCombinatorial optimization : _btheory and algorithms _cEdited by Bernhard Korte, Jens Vygen
250			_a6th ed.
260			_aNew York, NY : _bSpringer Berlin Heidelberg, _cc2018.
300			_axxi, 698 p. : _bill. ; _c25 cm.
490			_aAlgorithms and combinatorics ; _vvol. 21
520			_aThis 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.
650			_aAlgorithms _92438
650			_aCombinatorics _919067
700			_aKorte, Bernhard, _eEdited by _958929
700			_aVygen, Jens, _eEdited by _958930
856			_uhttps://uowd.box.com/s/qb1me0s3046evk008bsvl8f0v0cngh64 _zLocation Map