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.
Download or read it online for free here:
Download link
(830KB, PDF)
Similar books
Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithmsby Daniel Karapetyan - arXiv
Different aspects of heuristics design and evaluation are discussed. A broad spectrum of related subjects, covered in this research, includes test bed generation and analysis, implementation and performance issues, and more.
(5128 views)
Iterative Methods in Combinatorial Optimizationby Lap Chi Lau, R. Ravi, M. Singh - Cambridge University Press
This book describes a simple method that is iterative in essence, and useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical results.
(5888 views)
Advanced Graph Theory and Combinatorial Optimizationby Alexander Schrijver
From the table of contents: Shortest trees and branchings; Matchings and covers; Edge-colouring; Multicommodity flows and disjoint paths; Matroids; Perfect matchings in regular bipartite graphs; Minimum circulation of railway stock.
(7718 views)
A Course in Combinatorial Optimizationby Alexander Schrijver - University of Amsterdam
Contents: Shortest paths and trees; Polytopes, polyhedra, Farkas' lemma and linear programming; Matchings and covers in bipartite graphs; Menger's theorem, flows and circulations; Nonbipartite matching; Problems, algorithms and running time; etc.
(5935 views)