Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: Combinatorial optimization: Exact and approximate algorithms
Автор: Trevisan L.
These are minimally edited lecture notes from the class CS261: Optimization and Algorith-
mic Paradigms that I taught at Stanford in the Winter 2011 term. The following 18 lectures
cover topics in approximation algorithms, exact optimization, and online algorithms.
I gratefully acknowledge the support of the National Science Foundation, under grant CCF
1017403. Any opinions, ndings and conclusions or recommendations expressed in these
notes are my own and do not necessarily re
ect the views of the National Science Foundation.