18.434 Seminar in Theoretical Computer Science
1 of 5
Tamara Stern 2.9.06
Set Cover Problem (Chapter 2.1, 12)
What is the set cover problem?
Idea: You must select a minimum number [of any size set] of
Massachusetts Institute of Technology
18.434: Seminar in Theoretical Computer Science
Lecturer: Brian Jacokes
February 28, 2006
Lecture notes on multiway cuts and k -cuts
Consider a connected, undirec
Application of linear programming to set cover
and related problems
Daniel Gulotta
February 14, 2006
1
1.1
Review from last time
Set cover problem
U is the universal set, S is a collection of subsets
Linear Programming Algorithm
for the Multiway Cut Problem
Adam Groce
18.434: Seminar in Theoretical Computer Science
Prof. M. X. Goemans
March 2, 2006
1
The Problem
Recall from last time the multiway
Maximum Satisability
Phil Sung
March 17, 2006
The Boolean satisability problem (SAT) is the problem of deciding, given a Boolean expression
in variables x1 , , xn , whether some assignment of the vari
Massachusetts Institute of Technology
18.434: Seminar in Theoretical Computer Science
Lecturer: xyz
September 22, 2005
Lecture notes on non-bipartite matching
A
This is just a sample L TEXle (from lec
Massachusetts Institute of Technology 18.434: Seminar in Theoretical Computer Science
Lecturer: Lele Yu February 16, 2006
Lecture notes on Shortest Superstring Problem
So far we have studied the set c
Massachusetts Institute of Technology 18.434: Seminar in Theoretical Computer Science
Lecturer: Adriana Lopez March 7, 2006
Steiner Trees and Forests
1 Steiner Tree
Problem Given an undirected graph G
The Knapsack Problem and Fully Polynomial Time Approximation Schemes (FPTAS)
Katherine Lai 18.434: Seminar in Theoretical Computer Science Prof. M. X. Goemans March 10, 2006
1
The Knapsack Problem
In