Advanced Approximation Algorithms
CMU 15-854B, Spring 2008
Homework 4
Due: Thursday, March 20
1. Online Set Cover. In the online (unweighted) set cover problem, you are given a set system (U, S)
in ad
Advanced Approximation Algorithms
CMU 15-854B, Spring 2008
Homework 2
Due: Tuesday, February 12
1. Approximation Algorithms for weighted Min-Vertex-Cover. For each of the following approximation algor
Advanced Approximation Algorithms
CMU 15-854B, Spring 2008
H OMEWORK 6
Due: Thursday, May 1
Denitions: Given boolean functions f1 , . . . , fd , a k-query test is a probability distribution Pr on chec
Advanced Approximation Algorithms
CMU 15-854B, Spring 2008
H OMEWORK 5
Due: Tuesday, April 1
1. Fourier expansion uniqueness. Using only Parsevals Theorem (and arithmetic) show that each f : cfw_1, 1n
Advanced Approximation Algorithms
CMU 15-854B, Spring 2008
Homework 3
Due: Thursday, February 28
1. Some Generalizations of k-Center. These problems are not necessarily related to each
other so please
Advanced Approximation Algorithms
CMU 15-854B, Spring 2008
Homework 1
Due: Tuesday, January 29
1. Randomized approximation algorithms. Suppose A is a randomized algorithm for the
NP optimization probl
Advanced Approximation Algorithms
(CMU 15-854B, Spring 2008)
Lecture 5: Primal-Dual Algorithms and Facility Location
Jan 29, 2008
Lecturer: Anupam Gupta
Scribe: Varun Gupta
In the last lecture, we saw
Advanced Approximation Algorithms
(CMU 18-854B, Spring 2008)
Lecture 2: LP Relaxations, Randomized Rounding
Jan 17, 2008
Lecturer: Ryan ODonnell
1
Scribe: Ali Kemal Sinop
Introduction
In the last lect
Advanced Approximation Algorithms
(CMU 15-854B, Spring 2008)
Lecture 9: Hardness of Max-Ek-Indep.-Set and A.-k-Center
February 12, 2008
Lecturer: Ryan ODonnell, Anupam Gupta
Scribe: Eric Blais
In this
Advanced Approximation Algorithms
(CMU 18-854B, Spring 2008)
Lecture 7: Asymmetric K-Center
February 5, 2007
Lecturer: Anupam Gupta
Scribe: Jeremiah Blocki
In this lecture, we will consider the K-cent
Advanced Approximation Algorithms
(CMU 18-854B, Spring 2008)
Lecture 3: 1 vs 3/4 + Hardness for Max-Coverage
Jan 22, 2008
Lecturer: Ryan ODonnell
1
Scribe: Ravishankar Krishnaswamy
Outline
In this lec
Advanced Approximation Algorithms
(CMU 18-854B, Spring 2008)
Lecture 8: Hardness of Min-Ek-Hypergraph-Independent-Set
February 7 2008
Lecturer: Ryan ODonnell
1
Scribe: Aaron Roth
Introduction
In this
Advanced Approximation Algorithms
(CMU 18-854B, Spring 2008)
Lecture 4: Uncapacitated Facility Location
Jan 24, 2008
Lecturer: Anupam Gupta
Scribe: S. Harsha Vardhan
In this lecture, as well as the ne