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 in G is a subset S V . Let S = V \S, and let
E(S, S) den
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 approximation ratio you did prove, be it better or worse than .
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 our discussion on greedy algorithms. We look at the Set
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 simple and generic paradigm of greedy algorithms. A nice t
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 approximation ratio you did nd, be it better or worse than .
1. Mul
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 ratio you did prove, be it better or worse than .
1. (K
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 ratio you did prove, be it better or worse than . Also,
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 discuss the local search technique for designing approximati
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 ratio you did prove, be it better or worse than . Also, p
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 unweighted max cut problem and gave 2-approximation algorithms
b
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 several randomized approximation algorithms before. Recall
15-854: Approximations Algorithms
Topic: Dynamic Programming
Scribe: Mihir Kedia
Lecturer: Anupam Gupta
Date: October 12, 2005
Note: Starred sections were not specically covered in lecture - they serve to provide additional
background and information.
10.
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 in approximation algorithms. We will
demonstrate this
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 proof of the approximation guarantee given by local search
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 + djk dik for all i, j, k V . Given G and a positive integ