Combinatorial Optimization: Exact and Approximate Algorithms

Combinatorial Optimization: Exact and Approximate Algorithms
by Luca Trevisan

Publisher: Stanford University 2011
Number of pages: 139

Description:
In this course we study algorithms for combinatorial optimization problems, the type of algorithms that arise in countless applications. The following 18 lectures cover topics in approximation algorithms, exact optimization, and online algorithms.