CS266: Parametrized Algorithms and Complexity
Lecture 2
Scribe: Valeria Nikolaenko
1
Stanford University
Thursday, April 4
Spring 2013
Vertex Cover
We recall the denition of FPT from the previous lecture.
Denition 1.1 A parameteric problem L is FPT if the
CS266: Parameterized Algorithms and Complexity
Lecture 12
Scribe: Joshua Wang
1
Stanford University
Thursday, May 9, 2013
Spring 2013
Sparsication
Recall the exponential time hypothesis (ETH): k, > 0 such that k -S AT requires 2n time.
Today we will talk
CS266: Parameterized Algorithms and Complexity
Lecture 9
Scribe: Lynnelle Ye
1
Stanford University
Tuesday, April 30
Spring 2013
Recap
Recall from last time that we have a hierarchy FPT W[1] W (2) XP, where FPT is the set of problems
solvable in f (k )nc
CS266: Parameterized Algorithms and Complexity
Lecture 10
Scribe: Kevin Lewi
1
Stanford University
Thursday, May 2
Spring 2013
Last Time
Last time, we proved the following theorems about W[1].
Theorem 1.1 For all c > 2, Weighted c-SAT is W[1]-complete.
Th
CS266: Parameterized Algorithms and Complexity
Lecture 11
Scribe: Jack Chen
Stanford University
Tuesday, May 7
Spring 2013
In this lecture, we
show that a solution for k -dominating set in nk time implies the Strong Exponential Time Hypothesis (SETH)
is
CS266: Parameterized Algorithms and Complexity
Lecture 8
Scribe: Hart Montgomery
1
Stanford University
Thursday, April 25
Spring 2013
3-SAT Local Search
The lecture started with the presentation of the LS2 algorithm, due to Schoning 99, which is presented
CS266: Parameterized Algorithms and Complexity
Lecture 4
Scribe: Yongxing Deng and Virginia
Stanford University
Tuesday, April 11
Spring 2013
1 Preview
The k -PATH problem is the following parametrized version of the Longest Path problem. Given a graph G,
CS266: Parameterized Algorithms and Complexity
Lecture 3
Scribe: Huacheng Yu
1
Stanford University
Tuesday, April 9
Spring 2013
Review of Vertex Cover
In the last lecture, we discussed FPT algorithms for the k -vertex cover problem. By doing backtracking
CS266: Parameterized Algorithms and Complexity
Lecture 1
Scribe: Lucas Garron & Ryan
1
Stanford University
Tuesday, April 2
Spring 2013
Overview
Class URL: http:/www.stanford.edu/ rrwill/cs266.html
1.1
Workload
2 signicant problem sets
A
Scribe at least
CS266: Parameterized Algorithms and Complexity
Lecture 6
Scribe: Amir Abboud
1
Stanford University
Thursday, April 18
Spring 2013
Introduction
In this lecture we will talk about three problems that we dont think are FPT, and show faster than trivial algor
CS266: Parameterized Algorithms and Complexity
Lecture 7
Scribe: Chuanqi Shen (with some edits from Ryan)
1
Stanford University
Tuesday, April 23
Spring 2013
3-SAT algorithms
Today we will discuss some algorithms for solving 3-SAT that run in better-than-