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 these sets so that the sets you have picked
contain al
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, undirected graph G = (V, E ) with a weight function w : E R+ .
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 of U , and c : S N is a cost
function. The goal is to n
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 cut problem: given a graph with weighted
edges and a se
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 variables makes the expression true. SAT
is historically no
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 lecture notes in 18.433) with gures, references [1],
envir
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 covering problem, but not looked at any real life applic
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 <V, E A, a cost function c E Q , and a partition of V
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 the knapsack problem, you are given a knapsack of size