Tetris Hardness of Approximation - MITcourses.csail.mit.edu/6.890/fall14/lectures/L12_images.pdf ·...

Tetris Hardness of Approximation [Breukelaar, Demaine, Hohenberger, Hoogeboom, Kosters, Liben-Nowell 2003]

Presenter

Presentation Notes

http://erikdemaine.org/papers/Tetris_IJCGA/ (slide from Lecture 3)

Max E3-X(N)OR-SAT → Max E3SAT[Håstad 2001]

Presenter

Presentation Notes

Lecture 12 notes, based on reduction in http://dx.doi.org/10.1145/502090.502098

food

verb

transportation

animal

verb

furniture

Projection Puzzles [Moshkovitz]

Presenter

Presentation Notes

http://people.csail.mit.edu/dmoshkov/proj-games/index.html

b

a

t

b a t

food

verb

transportation

animal

verb

furniture

Score: 3


Presenter

Presentation Notes


b

cab

t

b a t

food

verb

transportation

animal

verb

furniture

c a b

Score: 6


Presenter

Presentation Notes


b

cabet

b a t

food

verb

transportation

animal

verb

furniture

c a b

b e d

Score: 8


Presenter

Presentation Notes


b

cabety

b a t

food

verb

transportation

animal

verb

furniture

c a b

b e d

Score: 10

c r y


Presenter

Presentation Notes


b

cabety

b a t

food

verb

transportation

animal

verb

furniture

c a b

b e d

Score: 10

c r y

? a y


Presenter

Presentation Notes


b

cabety

b a t

food

verb

transportation

animal

verb

furniture

c a b

b e d

Score: 10

c r y

? e y

? a y


Presenter

Presentation Notes


bpcabety

b a t

food

verb

transportation

animal

verb

furniture

c a b

b e d

Score: 15

c r y

p e a

p a y


Presenter

Presentation Notes


furniture

cscaroty

c a t

s a y

c a r

s o y

c o t

c r y

food

verb

transportation

animal

verb

Score: 18


Presenter

Presentation Notes


Typical Approximation FactorsApproximation Factor Minimization Problems Maximization Problems

1 + 𝜀𝜀 Planar/𝐻𝐻-minor-free/2D… e.g. dominating set

Planar/𝐻𝐻-minor-free/2D… e.g. independent set

Θ(1) Steiner tree, Steiner forest, Traveling Salesman, …

Maximum coverage,Max cut

Θ(log∗𝑛𝑛) Asymmetric 𝑘𝑘-center

Θ log𝑛𝑛Set cover, Dominating set,Node-weighted Steiner tree…

Unique coverage,Domatic number

Θ log2 𝑛𝑛 Group Steiner treeΩ log2 𝑛𝑛 ∩ 𝑂𝑂(𝑛𝑛𝜀𝜀) Directed Steiner tree

Ω 2log1−𝜀𝜀 𝑛𝑛 ∩ 𝑂𝑂 𝑛𝑛𝑐𝑐 Label cover (MinRep),Directed Steiner forest

Label cover (MaxRep)

Ω 𝑛𝑛1−𝜀𝜀 ∩ �𝑂𝑂 𝑛𝑛 Chromatic number Independent set = clique𝑐𝑐 = 4

5+ 𝜀𝜀

𝑐𝑐 = 13

Presenter

Presentation Notes

Edited version of summary by MohammadTaghi Hajiaghayi (from Lecture 10)

Reductions to Steiner Problems

Presenter

Presentation Notes

Lecture 12 notes

Tetris Hardness of Approximation - MITcourses.csail.mit.edu/6.890/fall14/lectures/L12_images.pdf ·...

Documents

Transcript of Tetris Hardness of Approximation - MITcourses.csail.mit.edu/6.890/fall14/lectures/L12_images.pdf ·...