- Добавил: Bookstream
- Дата: 24-08-2020, 10:29
- Комментариев: 0

Название: Combinatorial Optimization. Theory and Algorithms
Автор: Bernhard Korte, Jens Vygen
Издательство: Springer
Год: 2018
Формат: pdf
Страниц: 686
Размер: 10 Мб
Язык:
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.