15-854: Approximations Algorithms
Topic: Max-cut, Hardness of Approximations
Scribe: Haowen Chan
2.1
Lecturer: Anupam Gupta
Date: 9/14
The Max-Cut Problem
Given an undirected graph G = (V, E), a cut i
Approximation Algorithms
Date: Nov 30, 2005
Take-home Final
Due: Dec 12, 2005
Note: In all these problems: if we ask you to show an approximation ratio of , you should tell us about
the best approxima
15-854: Approximations Algorithms
Topic: Greedy Algorithms: Set Cover and Edge Disjoint Paths
Scribe: Pall Melsted
4.1
Lecturer: Anupam Gupta
Date: 9/21/2005
Introduction
In this lecture we continue o
15-854: Approximations Algorithms
Topic: Greedy Algorithms : Minimizing Makespan, Multiway Cut
Scribe: Vineet Goyal
3.1
Lecturer: R. Ravi
Date: 9/19/2005
Introduction
In this lecture, we discuss a sim
Approximation Algorithms
Date: Sept 21, 2005
Homework 2
Due: Sept 28, 2005
Note: In all these problems: if we ask you to show an approximation ratio of , you should tell us
about the best approximatio
Approximation Algorithms
Date: Sept 28, 2005
Homework 3
Due: Oct 5, 2005
Note: In all these problems: if we ask you to show an approximation ratio of , you should tell us
about the best approximation
Approximation Algorithms
Date: Oct 12, 2005
Homework 4
Due: Oct 19, 2005
Note: In all these problems: if we ask you to show an approximation ratio of , you should tell us about the
best approximation
15-854: Approximations Algorithms
Topic: Local Search: Max Leaf Spanning Tree, Min Degree Spanning Tree
Scribe: Florin Oprea
5.1
Lecturer: R. Ravi
Date: 9/26/2005
Introduction
In this lecture we discu
Approximation Algorithms
Date: Nov 2, 2005
Homework 5
Due: Nov 9, 2005
Note: In all these problems: if we ask you to show an approximation ratio of , you should tell us about the
best approximation ra
15-854: Approximations Algorithms
Topic: Local Search: Max Cut Revisited and k-Median
Scribe: Mohit Singh
7.1
Lecturer: Anupam Gupta
Date: 10/3/05
Introduction
In Lecture 2, we discussed the unweighte
15-854: Approximations Algorithms
Topic: Randomized Approximation Algorithms
Scribe: Don Sheehy
11.1
Lecturer: Anupam Gupta
Date: October 17, 2005
Randomized Approximation Algorithms
We have seen seve
15-854: Approximations Algorithms
Topic: The Local Ratio Method
Scribe: Viswanath Nagarajan
9.1
Lecturer: R. Ravi
Date: 10-10-2005
Introduction
In this lecture, we will study the local ratio technique
15-854: Approximations Algorithms
Topic: Local Search: Min Degree Spanning Tree
Scribe: Florin Oprea
6.1
Lecturer: R. Ravi
Date: 9/28/2005
Min Degree Spanning Tree
In this lecture we continue the proo
Approximation Algorithms
Date: Sept 14, 2005
Homework 1
Due: Sept 21, 2005
1. K-center: Consider an undirected complete graph G = (V, E) with nonnegative metric
distances d on the edges; i.e., dij + d