Combinatorial Optimization. Theory and AlgorithmsКНИГИ » ПРОГРАММИНГ
Название: 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.
Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.
This 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.
Скачать "Combinatorial Optimization. Theory and Algorithms"
Combinatorial Search: From Algorithms to Systems Название: Combinatorial Search: From Algorithms to Systems Автор: Youssef Hamadi Издательство: Springer Год: 2013 Формат: PDF Страниц: 139 Для сайта:...
Foundations of Machine Learning, Second Edition Название: Foundations of Machine Learning, Second Edition Автор: Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar Издательство: The MIT Press...
Навигация
Вход на сайт
Реклама
Combinatorial Optimization. Theory and Algorithms 
