First meeting: Wednesday, Jan. 5, in MC 2018 B, 2:00pm
Many of the problems that arise in practical applications of discrete
optimization are NP-hard, that is optimal solutions cannot be computed
in polynomial-time modulo the P not equal NP conjecture. Current
research is focusing on the design of polynomial-time approximation
algorithms for such problems.
The course will study some of the successful paradigms for designing
approximation algorithms and for proving approximation guarantees: the
greedy method, formulating and solving LP (linear programming)
relaxations, the (LP based) primal-dual method, randomized rounding,
semidefinite programming relaxations, approximation of metrics, etc.
Some lectures will focus on the hardness of approximating specific problems.
The plan is to cover a good fraction of Vazirani's book in the lectures, and also to cover some of the more recent results, e.g., from the recent text of Williamson and Shmoys.
(Similar courses have been offered in W'05, W'08, W'09, W'10.)
Assignments 50% Project 50%
Vijay Vazirani, Approximation Algorithms. ( homepage).
David Williamson and David Shmoys, The Design of Approximation Algorithms. ( homepage, PDF of book available).
Text on Computational Complexity:
Sanjeev Arora and Boaz Barak, Complexity Theory: A Modern Approach. ( homepage).
PDF files for each chapter and the whole book are on the web; some of the relevant parts are Chapter 2, NP and NP completeness, ( PDF), Chapter 18, PCP and hardness of approximation, ( PDF).
David Williamson, Lecture Notes on Approximation Algorithms, Fall 1998. IBM Research Report RC 21273, February 1999. ( homepage).
Michel Goemans has course notes on randomized algorithms, approximation algorithms, etc. ( homepage).
Cheriyan and Ram Ravi, Lecture Notes on Approximation Algorithms for Network Problems, ( lec notes page).
Hochbaum, D.S. (1996). Approximation algorithms for NP-hard problems. (Boston: PWS publishing co.).
P.Crescenzi, and V.Kann. A compendium of NP optimization problems ( homepage).
David Johnson's NP-Completeness Columns (PDF files for all)
The NP-Completeness Column: The Many Limits on Approximation, David S. Johnson, ACM Transactions on Algorithms (TALG) 2(3):473-489 (July 2006)
Charikar (Princeton), CS 594: Limits on Approximation, S07
Chekuri (UIUC), CS 598: Approximation Algorithms, F06
Gupta & Ravi (CMU), 15-854: Approximation Algorithms, F05
Guruswami & O'Donnell (U.Wash.), CSE 533: The PCP Theorem and Hardness of Approximation, F05
Khot (G.Tech), CS 8002: Probabilistically Checkable Proofs and Hardness of Approximation, F04
Roughgarden (Stanford), CS359: Hardness of Approximation, W07
Salavatipour (UA), CMPUT 675: Topics on Approximation Algorithms and Approximability, F07
Sudan (MIT), Approximability of Optimization Problems, F99
Students are allowed to collaborate on the assignments to the extent of formulating ideas as a group. Each student is expected to write up the solutions by himself or herself. All hints, collaboration, outside help etc. should be explicitly listed in your submission.
Assignment 1, due Jan. 26 (Wed), in class
Assignment 2, due Feb. 16 (Wed), in class
Assignment 3, due Mar. 16 (Wed), in class
Assignment 4, due Mar. 31 (Thu),
Sanjeev Arora, Approximation schemes for NP-hard geometric optimization problems: a survey (postscript, author's page) OR Math. Programming B 97, 43--69, 2003, DOI: 10.1007/s10107-003-0438-y (PDF available via UW)