inapproximability of the smallest superpolyomino problem
Download
Skip this Video
Download Presentation
Inapproximability of the Smallest Superpolyomino Problem

Loading in 2 Seconds...

play fullscreen
1 / 32

Inapproximability of the Smallest Superpolyomino Problem - PowerPoint PPT Presentation


  • 81 Views
  • Uploaded on

Inapproximability of the Smallest Superpolyomino Problem. Andrew Winslow Tufts University. Polyominoes. Colored poly-squares . (stick). Rotation disallowed. (stick). Smallest superpolyomino problem. Given a set of polyominoes : Find a small superpolyomino :. (stick).

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Inapproximability of the Smallest Superpolyomino Problem' - angie


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
polyominoes
Polyominoes

Colored poly-squares

(stick)

Rotation disallowed

smallest superpolyomino problem

(stick)

Smallest superpolyomino problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem1

(stick)

Smallest superpolyomino problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem2

(stick)

Smallest superpolyomino problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem3

(stick)

Smallest superpolyomino problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem4

(stick)

Smallest superpolyomino problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem5

(stick)

Smallest superpolyomino problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem6

(stick)

Smallest superpolyomino problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem is np hard

Known results

Smallest superpolyomino problem is NP-hard. 

(stick)

But greedy 4-approximation exists! 

Yields simple, useful string compression. 

smallest superpolyomino problem7
Smallest Superpolyomino Problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem8
Smallest Superpolyomino Problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem9
Smallest Superpolyomino Problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem10
Smallest Superpolyomino Problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem11
Smallest Superpolyomino Problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem12
Smallest Superpolyomino Problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem13
Smallest Superpolyomino Problem

Given a set of polyominoes:

Find a small superpolyomino:

smallest superpolyomino problem14
Smallest Superpolyomino Problem

Given a set of polyominoes:

Find a small superpolyomino:

slide19

O(n1/3 – ε)-approximation is NP-hard. 

(ε > 0)

(even if only two colors)

NP-hard even if only one color is used. 

Simple, useful image compression? No

reduction idea
Reduction Idea

Reduce from chromatic number.

Polyomino ≈vertex.

Polyominoes can stack iff

vertices aren’t adjacent.

one color polyomino sets
One-color polyomino sets

Reduction from set cover.

slide25

Sets

Elements

smallest superpolyomino problem is np hard1

The good, the bad, and the inapproximable.

Smallest superpolyomino problem is NP-hard. 

(stick)

KNOWN

But greedy 4-approximation exists. 

One-color variant is trivial. 

Smallest superpolyomino problem is NP-hard. 

  • O(n1/3 – ε)-approximation is NP-hard. 
  • One-color variant is NP-hard. 
open related problem
Open(?) related problem

The one-color variant is a constrained version of:

“Given a set of polygons, find the

minimum-area union of these polygons.”

What is known? References?

greedy approximation algorithm
Greedy approximation algorithm

input:

output:

Givessuperpolyomino at most 4 times

size of optimal: a 4-approximation.

inapproximability ratio
Inapproximability ratio
  • Stack size is θ(|V|2)

So smallest superpolyomino is O(n1/3-ε)-inapproximable.

k-stack superpolyomino has size θ(k|V|2):

  • k is (n1-ε)-inapproximable.
slide31

Cheating is as bad as worst cover.

  • So smallest superpolyomino is a good cover
  • and finding it is NP-hard.
smallest superpolyomino problem15

(stick)

Smallest superpolyomino problem

Given a set of polyominoes:

Find a small superpolyomino:

ad