efficient simplification: the (im)possibilities
DESCRIPTION
TRANSCRIPT
![Page 1: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/1.jpg)
Efficient Simplication:
The (im)possibilities
IMPECS 2010
![Page 2: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/2.jpg)
Discovering definitions.
kernelization
preprocessing, simplification, data reduction
KERNELS
![Page 3: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/3.jpg)
Lower Bounds
Upper Bounds
Combinatorial Toolsand applications towards
obtaining kernels.
Compositions, reductions,and beyond:
techniques with applications.
![Page 4: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/4.jpg)
Consider the following nightmare from high school algebra homework:
![Page 5: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/5.jpg)
Evaluate:
394x6 + 98x5y2 − 821x7y8 + 24x3
−14x3 + 600y8x7 + 6x6
−100x5y2 − 400x6 + 221x7y8
at x = (7+ 9i) and y = (24− 5i).
![Page 6: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/6.jpg)
Evaluate:
394x6 + 98x5y2 − 821x7y8 + 24x3
−14x3 + 600y8x7 + 6x6
−100x5y2 − 400x6 + 221x7y8
at x = (7+ 9i) and y = (24− 5i).
![Page 7: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/7.jpg)
Evaluate:
394x6 + 98x5y2 − 821x7y8 + 24x3
−14x3 + 600y8x7 + 6x6
−100x5y2 − 400x6 + 221x7y8
at x = (7+ 9i) and y = (24− 5i).
![Page 8: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/8.jpg)
Evaluate:
394x6 + 98x5y2 − 821x7y8 + 24x3
−14x3 + 600y8x7 + 6x6
−100x5y2 − 400x6 + 221x7y8
at x = (7+ 9i) and y = (24− 5i).
![Page 9: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/9.jpg)
Evaluate:
394x6 + 98x5y2 − 821x7y8 + 24x3
−14x3 + 600y8x7 + 6x6
−100x5y2 − 400x6 + 221x7y8
at x = (7+ 9i) and y = (24− 5i).
![Page 10: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/10.jpg)
Evaluate:
394x6 +98x5y2 − 821x7y8 + 10x3
−14x3 + 600y8x7 + 6x6
−102x5y2 − 400x6 + 221x7y8
at x = (7+ 9i) and y = (24− 5i).
![Page 11: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/11.jpg)
Evaluate:
394x6 + 98x5y2 − 821x7y8 + 24x3
−14x3 + 600y8x7 + 6x6
−100x5y2 − 400x6 + 221x7y8
at x = (7+ 9i) and y = (24− 5i).
![Page 12: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/12.jpg)
Evaluate:
394x6 +98x5y2 − 821x7y8 + 10x3
−14x3 + 600y8x7 + 6x6
−102x5y2 − 400x6 + 221x7y8
at x = (7+ 9i) and y = (24− 5i).
![Page 13: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/13.jpg)
Simplification is a good idea.
When you cannot simplify, your problem might be declared irreducible.
We want to think about coming up with a definition for the notion of agood simplification procedure.
![Page 14: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/14.jpg)
Simplification is a good idea.When you cannot simplify, your problem might be declared irreducible.
We want to think about coming up with a definition for the notion of agood simplification procedure.
![Page 15: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/15.jpg)
Simplification is a good idea.When you cannot simplify, your problem might be declared irreducible.
We want to think about coming up with a definition for the notion of agood simplification procedure.
![Page 16: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/16.jpg)
A simplification procedure is powerful if it works...
...all the time — on any input, however complicated.
![Page 17: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/17.jpg)
A simplification procedure is powerful if it works...
...all the time — on any input, however complicated.
![Page 18: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/18.jpg)
A simplification procedure is efficient if it beats...
...a brute-force approach hands-down — the faster, the better.
![Page 19: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/19.jpg)
A simplification procedure is efficient if it beats...
...a brute-force approach hands-down — the faster, the better.
![Page 20: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/20.jpg)
A simplification procedure is good if it ispowerful and efficient.
![Page 21: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/21.jpg)
Are there problems for which we can devise provably goodsimplification procedures?
![Page 22: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/22.jpg)
Notice that if there are problems with good simplification procedures,then such simplifications would be in great demand. Imagine solving allyour algebra homework quickly, every single time!
e performance guarantees make the simplification really special.
![Page 23: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/23.jpg)
Notice that if there are problems with good simplification procedures,then such simplifications would be in great demand. Imagine solving allyour algebra homework quickly, every single time!
e performance guarantees make the simplification really special.
![Page 24: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/24.jpg)
Are there problems for which we provably cannot devise goodsimplification procedures?
![Page 25: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/25.jpg)
Notice that showing such a negative result entails demonstrating some“inherent hardness” of the problem, because of which no simplificationprocedure can offer a performance guarantee.
![Page 26: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/26.jpg)
What does it mean to “simplify”?
![Page 27: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/27.jpg)
e natural idea of simplification is “to reduce”.
Make it smaller.
Let’s try to formalize this.
![Page 28: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/28.jpg)
e natural idea of simplification is “to reduce”.
Make it smaller.
Let’s try to formalize this.
![Page 29: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/29.jpg)
e natural idea of simplification is “to reduce”.
Make it smaller.
Let’s try to formalize this.
![Page 30: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/30.jpg)
Let us use n to denote the “size” of the problem.
Clearly, it is n that we wish to make smaller.
![Page 31: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/31.jpg)
Let us use n to denote the “size” of the problem.
Clearly, it is n that we wish to make smaller.
![Page 32: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/32.jpg)
Proposed Definition #1
![Page 33: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/33.jpg)
A simplification routine should:
• run in polynomial time,• take as input a problem instance of size n, and• return an equivalent instance of size n ′ < n.
![Page 34: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/34.jpg)
eoremA NP-complete problem cannot be simplified unless P = NP.
Proof.Let X be an instance of a NP-complete problem, and suppose it admits asimplification routine.
X−→X1−→ · · · −→Xn
In polynomial time, we have simplified too severely — we have solvedthe problem! is gives us P = NP.
![Page 35: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/35.jpg)
eoremA NP-complete problem cannot be simplified unless P = NP.
Proof.Let X be an instance of a NP-complete problem, and suppose it admits asimplification routine.
X−→X1−→ · · · −→Xn
In polynomial time, we have simplified too severely — we have solvedthe problem! is gives us P = NP.
![Page 36: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/36.jpg)
Proposed Definition #2
![Page 37: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/37.jpg)
Demanding that we reduce the instance with every run of thesimplification: unreasonable.
Let us try demanding that a simplification process reduces until somepoint, after which we might obtain something that cannot be reduced
further.
![Page 38: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/38.jpg)
Demanding that we reduce the instance with every run of thesimplification: unreasonable.
Let us try demanding that a simplification process reduces until somepoint, after which we might obtain something that cannot be reduced
further.
![Page 39: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/39.jpg)
A simplification routine should:
• run in polynomial time,• take as input a problem instance of size n, and• return an equivalent instance of size n ′ < n.
Does this work?
![Page 40: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/40.jpg)
A simplification routine should:
• run in polynomial time,• take as input a problem instance of size n, and• return an equivalent instance of size 100.
Does this work?
![Page 41: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/41.jpg)
A simplification routine should:
• run in polynomial time,• take as input a problem instance of size n, and• return an equivalent instance of size 100.
Does this work?
![Page 42: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/42.jpg)
A simplification routine should:
• run in polynomial time,• take as input a problem instance of size n, and• return an equivalent instance of size 100.
NO.
![Page 43: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/43.jpg)
A simplification routine should:
• run in polynomial time,• take as input a problem instance of size n, and• return an equivalent instance of size f(p).
Does this work?
![Page 44: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/44.jpg)
A simplification routine should:
• run in polynomial time,• take as input a problem instance of size n, and• return an equivalent instance of size f(p).
Does this work?
![Page 45: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/45.jpg)
A simplification routine should:
• run in polynomial time,• take as input a problem instance of size n, and• return an equivalent instance of size f(p).
Does this work?
![Page 46: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/46.jpg)
ere are people at a professor’s party.
e professor would like to locate a group of six people who are popular.
i.e, everyone is a friend of at least one of the six.
Being a busy man, he asks two of his students to find such a group.
e first grimaces and starts making a list of(256
)possibilities.
e second knows that no one in the party has more than three friends¹.
¹Academicians tend to be lonely.
![Page 47: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/47.jpg)
ere are people at a professor’s party.
e professor would like to locate a group of six people who are popular.
i.e, everyone is a friend of at least one of the six.
Being a busy man, he asks two of his students to find such a group.
e first grimaces and starts making a list of(256
)possibilities.
e second knows that no one in the party has more than three friends¹.
¹Academicians tend to be lonely.
![Page 48: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/48.jpg)
ere is a graph on n vertices.
e professor would like to locate a group of six people who are popular.
i.e, everyone is a friend of at least one of the six.
Being a busy man, he asks two of his students to find such a group.
e first grimaces and starts making a list of(256
)possibilities.
e second knows that no one in the party has more than three friends¹.
¹Academicians tend to be lonely.
![Page 49: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/49.jpg)
ere is a graph on n vertices.
Is there a dominating set of size at most k?
i.e, everyone is a friend of at least one of the six.
Being a busy man, he asks two of his students to find such a group.
e first grimaces and starts making a list of(256
)possibilities.
e second knows that no one in the party has more than three friends¹.
¹Academicians tend to be lonely.
![Page 50: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/50.jpg)
ere is a graph on n vertices.
Is there a dominating set of size at most k?
(Every vertex is a neighbor of at least one of the k vertices.)
Being a busy man, he asks two of his students to find such a group.
e first grimaces and starts making a list of(256
)possibilities.
e second knows that no one in the party has more than three friends¹.
¹Academicians tend to be lonely.
![Page 51: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/51.jpg)
ere is a graph on n vertices.
Is there a dominating set of size at most k?
(Every vertex is a neighbor of at least one of the k vertices.)
e problem is NP–complete,
e first grimaces and starts making a list of(256
)possibilities.
e second knows that no one in the party has more than three friends¹.
¹Academicians tend to be lonely.
![Page 52: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/52.jpg)
ere is a graph on n vertices.
Is there a dominating set of size at most k?
(Every vertex is a neighbor of at least one of the k vertices.)
e problem is NP–complete,
but is trivial on “large” graphs of bounded degree,
e second knows that no one in the party has more than three friends¹.
¹Academicians tend to be lonely.
![Page 53: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/53.jpg)
ere is a graph on n vertices.
Is there a dominating set of size at most k?
(Every vertex is a neighbor of at least one of the k vertices.)
e problem is NP–complete,
but is trivial on “large” graphs of bounded degree,
as you can say NO whenever n > kb.
![Page 54: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/54.jpg)
Notation
We denote a parameterized problem as a pair (Q, κ) consisting of a clas-sical problem Q ⊆ {0, 1}∗ and a parameterization κ : {0, 1}∗ → N.
![Page 55: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/55.jpg)
.
.Size of the Kernel
.
.Kernel
Problem Simplification
involves pruning down
a large input
into an equivalent,
significantly smaller object,
quickly.
![Page 56: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/56.jpg)
.
.Size of the Kernel
.
.Kernel
Problem Simplification
is a function f : {0, 1}∗ × N → {0, 1}∗ × N, such that
a large input
into an equivalent,
significantly smaller object,
quickly.
![Page 57: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/57.jpg)
.
.Size of the Kernel
.
.Kernel
Problem Simplification
is a function f : {0, 1}∗ × N → {0, 1}∗ × N, such that
for all (x, k), |x| = n
into an equivalent,
significantly smaller object,
quickly.
![Page 58: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/58.jpg)
.
.Size of the Kernel
.
.Kernel
Problem Simplification
is a function f : {0, 1}∗ × N → {0, 1}∗ × N, such that
for all (x, k), |x| = n
f(x), k ′ ∈ L iff (x, k) ∈ L,
significantly smaller object,
quickly.
![Page 59: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/59.jpg)
.
.Size of the Kernel
.
.Kernel
Problem Simplification
is a function f : {0, 1}∗ × N → {0, 1}∗ × N, such that
for all (x, k), |x| = n
f(x), k ′ ∈ L iff (x, k) ∈ L,
|f(x)| = g(k),
quickly.
![Page 60: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/60.jpg)
.
.Size of the Kernel
.
.Kernel
Problem Simplification
is a function f : {0, 1}∗ × N → {0, 1}∗ × N, such that
for all (x, k), |x| = n
f(x), k ′ ∈ L iff (x, k) ∈ L,
|f(x)| = g(k),
and f is polytime computable.
![Page 61: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/61.jpg)
.
.Size of the Kernel
.
.Kernel
A kernelization procedure
is a function f : {0, 1}∗ × N → {0, 1}∗ × N, such that
for all (x, k), |x| = n
f(x), k ′ ∈ L iff (x, k) ∈ L,
|f(x)| = g(k),
and f is polytime computable.
![Page 62: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/62.jpg)
.
.Size of the Kernel
.
.Kernel
A kernelization procedure
is a function f : {0, 1}∗ × N → {0, 1}∗ × N, such that
for all (x, k), |x| = n
(f(x), k ′) ∈ L iff (x, k) ∈ L,
|f(x)| = g(k),
and f is polytime computable.
![Page 63: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/63.jpg)
.
.Size of the Kernel
.
.Size of the Kernel
A kernelization procedure
is a function f : {0, 1}∗ × N → {0, 1}∗ × N, such that
for all (x, k), |x| = n
f(x), k ′ ∈ L iff (x, k) ∈ L,
|f(x)| = g(k),
and f is polytime computable.
![Page 64: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/64.jpg)
eorem
Having a kernelization procedure implies, and is implied by,parameterized tractability.
Definition
A parameterized problem L is fixed-parameter tractable if there exists analgorithm that decides in f (k) · nO(1) time whether (x, k) ∈ L, wheren := |x|, k := κ(x), and f is a computable function that does not dependon n.
![Page 65: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/65.jpg)
eorem
Having a kernelization procedure implies, and is implied by,parameterized tractability.
Definition
A parameterized problem L is fixed-parameter tractable if there exists analgorithm that decides in f (k) · nO(1) time whether (x, k) ∈ L, wheren := |x|, k := κ(x), and f is a computable function that does not dependon n.
![Page 66: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/66.jpg)
eorem
A problem admits a kernel if, and only if,it is fixed–parameter tractable.
Definition
A parameterized problem L is fixed-parameter tractable if there exists analgorithm that decides in f (k) · nO(1) time whether (x, k) ∈ L, wheren := |x|, k := κ(x), and f is a computable function that does not dependon n.
![Page 67: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/67.jpg)
eorem
A problem admits a kernel if, and only if,it is fixed–parameter tractable.
Given a kernel, a FPT algorithm is immediate (even brute–force on thekernel will lead to such an algorithm).
![Page 68: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/68.jpg)
eorem
A problem admits a kernel if, and only if,it is fixed–parameter tractable.
On the other hand, a FPT runtime of f(k)·nc gives us a f(k)–sized kernel.
We run the algorithm for nc+1 steps and either have a trivial kernel if thealgorithm stops, else:
nc+1 < f(k) · nc
![Page 69: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/69.jpg)
eorem
A problem admits a kernel if, and only if,it is fixed–parameter tractable.
On the other hand, a FPT runtime of f(k)·nc gives us a f(k)–sized kernel.
We run the algorithm for nc+1 steps and either have a trivial kernel if thealgorithm stops, else:
n < f(k)
![Page 70: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/70.jpg)
“Efficient” Kernelization
What is a reasonable notion of efficiency for kernelization?
e smaller, the better.
In particular,
Polynomial–sized kernels <arebetter than Exponential–sized Kernels
![Page 71: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/71.jpg)
“Efficient” Kernelization
What is a reasonable notion of efficiency for kernelization?e smaller, the better.
In particular,
Polynomial–sized kernels <arebetter than Exponential–sized Kernels
![Page 72: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/72.jpg)
“Efficient” Kernelization
What is a reasonable notion of efficiency for kernelization?e smaller, the better.
In particular,
Polynomial–sized kernels <arebetter than Exponential–sized Kernels
![Page 73: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/73.jpg)
e problem of finding Dominating Set of size k on graphs where thedegree is bounded by b, parameterized by k, has a linear kernel. is is anexample of a polynomial–sized kernel.
![Page 74: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/74.jpg)
UPPER BO
UN
DS
Examples of Polynomial Kernels
![Page 75: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/75.jpg)
UPPER BO
UN
DS
.
..
Vertex Cover
independent set
![Page 76: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/76.jpg)
UPPER BO
UN
DS
.
..
Vertex Cover
Input: A graph G = (V, E) and an integer k.
Question: Does there exist a subset S of at most k vertices such that:for every edge (u, v), either u ∈ S or v ∈ S?
Parameter: k
![Page 77: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/77.jpg)
UPPER BO
UN
DS
.
..
Vertex Cover
Input: A graph G = (V, E) and an integer k.
Question: Does there exist a subset S of at most k vertices such that:for every edge (u, v), either u ∈ S or v ∈ S?
Parameter: k
![Page 78: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/78.jpg)
UPPER BO
UN
DS
.
..
Vertex Cover
Input: A graph G = (V, E) and an integer k.
Question: Does there exist a subset S of at most k vertices such that:for every edge (u, v), either u ∈ S or v ∈ S?
Parameter: k
![Page 79: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/79.jpg)
UPPER BO
UN
DS
.
..
Vertex Cover
Let us simplify!
![Page 80: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/80.jpg)
UPPER BO
UN
DS
.
..
Vertex Cover
A vertex v of degree more than k is a part of any vertex cover of size atmost k.
ere is always a vertex cover that does not pick isolated vertices.
A graph with more than k2 edges, without isolated vertices and verticesof high degree, has no vertex cover of size at most k.
![Page 81: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/81.jpg)
UPPER BO
UN
DS
.
..
Vertex Cover
A vertex v of degree more than k is a part of any vertex cover of size atmost k.
ere is always a vertex cover that does not pick isolated vertices.
A graph with more than k2 edges, without isolated vertices and verticesof high degree, has no vertex cover of size at most k.
![Page 82: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/82.jpg)
UPPER BO
UN
DS
.
..
Vertex Cover
A vertex v of degree more than k is a part of any vertex cover of size atmost k.
ere is always a vertex cover that does not pick isolated vertices.
A graph with more than k2 edges, without isolated vertices and verticesof high degree, has no vertex cover of size at most k.
![Page 83: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/83.jpg)
UPPER BO
UN
DS
.
..
3-Hitting Set
Input: A set U and a family F of subsets of U, size three each.
Question: Does there exist a subset S of U, of size at most k, such that:for every set X ∈ F, X ∩ S 6= ∅?
Parameter: k
![Page 84: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/84.jpg)
UPPER BO
UN
DS
.
..
3-Hitting Set
Input: A set U and a family F of subsets of U, size three each.
Question: Does there exist a subset S of U, of size at most k, such that:for every set X ∈ F, X ∩ S 6= ∅?
Parameter: k
![Page 85: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/85.jpg)
UPPER BO
UN
DS
.
..
3-Hitting Set
Input: A set U and a family F of subsets of U, size three each.
Question: Does there exist a subset S of U, of size at most k, such that:for every set X ∈ F, X ∩ S 6= ∅?
Parameter: k
![Page 86: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/86.jpg)
UPPER BO
UN
DS
.
..
3-Hitting Set
Input: {a, b, x}, {x, s, r}, {s, i, l}, {p, q, a}, {z, r, c}
Solution: {a,s,r} “hits” every set.
Observation: No hitting set of size two.
![Page 87: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/87.jpg)
UPPER BO
UN
DS
.
..
3-Hitting Set
Input: {a, b, x}, {x, s, r}, {s, i, l}, {p, q, a}, {z, r, c}
Solution: {a,s,r} “hits” every set.
Observation: No hitting set of size two.
![Page 88: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/88.jpg)
UPPER BO
UN
DS
.
..
3-Hitting Set
Input: {a, b, x}, {x, s, r}, {s, i, l}, {p, q, a}, {z, r, c}
Solution: {a,s,r} “hits” every set.
Observation: No hitting set of size two.
![Page 89: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/89.jpg)
UPPER BO
UN
DS
.
..
3-Hitting Set
Exercise: Is there an O(k3) kernel? An O(k2) kernel?
![Page 90: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/90.jpg)
UPPER BO
UN
DS
.
..
Connected Vertex Cover
Input: A graph G = (V, E) and an integer k.
Question: Does there exist a subset S of at most k vertices such that:for every edge (u, v), either u ∈ S or v ∈ S, and G[S] is connected?
Parameter: k
![Page 91: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/91.jpg)
UPPER BO
UN
DS
.
..
Connected Vertex Cover
Input: A graph G = (V, E) and an integer k.
Question: Does there exist a subset S of at most k vertices such that:for every edge (u, v), either u ∈ S or v ∈ S, and G[S] is connected?
Parameter: k
![Page 92: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/92.jpg)
UPPER BO
UN
DS
.
..
Connected Vertex Cover
Input: A graph G = (V, E) and an integer k.
Question: Does there exist a subset S of at most k vertices such that:for every edge (u, v), either u ∈ S or v ∈ S, and G[S] is connected?
Parameter: k
![Page 93: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/93.jpg)
UPPER BO
UN
DS
.
..
Connected Vertex Cover
Exercise: Is there an O(k2) kernel? An O(kO(1)) kernel?
![Page 94: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/94.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
forest
![Page 95: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/95.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Input: A graph G = (V, E) and an integer k.
Question: Does there exist a subset S of at most k vertices such that:G[V \ S] is a forest?
Parameter: k
![Page 96: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/96.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Input: A graph G = (V, E) and an integer k.
Question: Does there exist a subset S of at most k vertices such that:G[V \ S] is a forest?
Parameter: k
![Page 97: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/97.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Input: A graph G = (V, E) and an integer k.
Question: Does there exist a subset S of at most k vertices such that:G[V \ S] is a forest?
Parameter: k
![Page 98: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/98.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Notice that in this problem, we are looking to hit cycles.
Since cycles never involve vertices of degree zero or one, such vertices donot participate in an optimal FVS.
e immediate simplification is to remove isolated (degree ) andpendant (degree ) vertices.
![Page 99: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/99.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Notice that in this problem, we are looking to hit cycles.
Since cycles never involve vertices of degree zero or one, such vertices donot participate in an optimal FVS.
e immediate simplification is to remove isolated (degree ) andpendant (degree ) vertices.
![Page 100: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/100.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Notice that in this problem, we are looking to hit cycles.
Since cycles never involve vertices of degree zero or one, such vertices donot participate in an optimal FVS.
e immediate simplification is to remove isolated (degree ) andpendant (degree ) vertices.
![Page 101: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/101.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
What about vertices of degree two?
ese are also simple to handle...
![Page 102: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/102.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
What about vertices of degree two?
ese are also simple to handle...
![Page 103: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/103.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
![Page 104: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/104.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
![Page 105: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/105.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Notice that we now have a graph whose minimumdegree is at least three.
What about vertices of high degree?
![Page 106: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/106.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Notice that we now have a graph whose minimumdegree is at least three.
What about vertices of high degree?
![Page 107: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/107.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Recall that we were lucky with high degree vertices forvertex cover.
Let’s be optimistic and assume that we will get luckyagain...
![Page 108: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/108.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Recall that we were lucky with high degree vertices forvertex cover.
Let’s be optimistic and assume that we will get luckyagain...
![Page 109: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/109.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
So suppose X is a procedure for simplifying vertices ofdegree more than s.
What can we say about a graph that is simplified to the extent of beingdegree at least three, and not having vertices of degree more than s?
![Page 110: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/110.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
So suppose X is a procedure for simplifying vertices ofdegree more than s.
What can we say about a graph that is simplified to the extent of beingdegree at least three, and not having vertices of degree more than s?
![Page 111: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/111.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
FVS
forest
#of edges
Minimum degree three...
![Page 112: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/112.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
FVS
forest
#of edges
![Page 113: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/113.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
FVS
forest
#of edges
![Page 114: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/114.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Now we simply have to target high-degree vertices, andtry to discover the procedure X that we assumed before.
![Page 115: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/115.jpg)
UPPER BO
UN
DS
A
B
Consider a bipartite graph one of whose parts (say B) is at least twice asbig as the other (call this A).
![Page 116: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/116.jpg)
UPPER BO
UN
DS
A
B
Assume that there are no isolated vertices in B.bleh
![Page 117: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/117.jpg)
UPPER BO
UN
DS
Suppose, further, that for every subset S in A, N(S) is at least twice aslarge as |S|.
![Page 118: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/118.jpg)
UPPER BO
UN
DS
S
N(S)
Suppose, further, that for every subset S in A, N(S) is at least twice aslarge as |S|.
![Page 119: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/119.jpg)
UPPER BO
UN
DS
A
B
en there exist two matchings saturating A,bleh
![Page 120: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/120.jpg)
UPPER BO
UN
DS
A
B
en there exist two matchings saturating A,bleh
![Page 121: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/121.jpg)
UPPER BO
UN
DS
A
B
en there exist two matchings saturating A,and disjoint in B.
![Page 122: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/122.jpg)
UPPER BO
UN
DS
Claim:
If N(A) > 2|A|, then there exists a subset S of A such that:
there 2 matchings saturating the subset Sthat are vertex-disjoint in B.
provided B does not have any isolated vertices.
![Page 123: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/123.jpg)
UPPER BO
UN
DS
Claim:
If N(A) > 2|A|, then there exists a subset S of A such that:
there 2 matchings saturating the subset Sthat are vertex-disjoint in B.
provided B does not have any isolated vertices.
![Page 124: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/124.jpg)
UPPER BO
UN
DS
Claim:
If |B| > 2|A|, then there exists a subset S of A such that:
there 2 matchings saturating the subset Sthat are vertex-disjoint in B,
provided B does not have any isolated vertices.
![Page 125: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/125.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
In this case, S = A and we are done.
![Page 126: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/126.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
In this case, S = A and we are done.
![Page 127: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/127.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
In this case, S = A and we are done.
![Page 128: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/128.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.
In this case, S = A and we are done.
![Page 129: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/129.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.
Delete the vertices of S and the edges incident on it,
![Page 130: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/130.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.
and remove any isolated vertices created in B.
![Page 131: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/131.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.
and remove any isolated vertices created in B.
![Page 132: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/132.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.In the graph that is left, |B| is still
larger than 2|A|.
and remove any isolated vertices created in B.
![Page 133: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/133.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.In the graph that is left, |B| is still
larger than 2|A|.
|B|−N(S) 6|A|−2|S|
![Page 134: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/134.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.In the graph that is left, |B| is still
larger than 2|A|.
|B|−N(S) >|A|− 2|S|
![Page 135: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/135.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.In the graph that is left, |B| is still
larger than 2|A|.
|B|−N(S)> 2|A|− 2|S|
![Page 136: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/136.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.In the graph that is left, |B| is still
larger than 2|A|.
|B|−N(S)> 2|A|− 2|S|
![Page 137: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/137.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.In the graph that is left, |B| is still
larger than 2|A|.
|B|−N(S) > 2(|A|− |S|)
![Page 138: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/138.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.Done: by repetition.
|B|−N(S) > 2(|A|− |S|)
![Page 139: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/139.jpg)
UPPER BO
UN
DS
If N(S) > 2|S| for all subsets S, thenthere are 2 matchings,
vertex-disjoint in B, saturating A.blah blah blah blah blah blah blahblah blah blah blah blah blah blah
Else: there exists a subset S forwhich N(S) is smaller than 2|S|.
row it away.Done: by repetition.
(And you’ll never clear everythingout, because |B| is consistently
more than 2|A|.)
|B|−N(S) > 2(|A|− |S|)
![Page 140: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/140.jpg)
Ingredients
![Page 141: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/141.jpg)
Ingredients
a high-degree vertex, v
![Page 142: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/142.jpg)
Ingredients
a high-degree vertex, v
a small hitting set,sans v
![Page 143: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/143.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
Any hitting set whose size is a polynomial function of k.
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 144: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/144.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
A subset whose removal makes the graph acyclic.
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 145: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/145.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
A polynomial function of k.
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 146: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/146.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
At least twice the size of the hitting set.
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 147: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/147.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
Find an approximate hitting set S.
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 148: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/148.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
If S does not contain v, we are done.
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 149: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/149.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
Else: v ∈ S. Delete S \ v from G.
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 150: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/150.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
e only remaining cycles pass through v.
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 151: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/151.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
Find an optimal cut set for paths from N(v) to N(v).
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 152: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/152.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
Why is this cut set small enough?
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 153: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/153.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
When is this cut set small enough?
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 154: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/154.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
When is this cut set small enough?
When the largest collection of vertex disjoint paths from N(v) to N(v) issmall.
![Page 155: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/155.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
When is this cut set small enough?
When the largest collection of vertex disjoint paths from N(v) to N(v) isnot small...
![Page 156: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/156.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
When is this cut set small enough?
When the largest collection of vertex disjoint paths from N(v) to N(v) isnot small... we get a reduction rule.
![Page 157: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/157.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
When is this cut set small enough?
More than k vertex-disjoint paths from N(v) to N(v)→ v belongs to any hitting set of size at most k.
![Page 158: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/158.jpg)
UPPER BO
UN
DS
Given a high-degree vertex v, finding a small hitting set that does notcontain v.
When is this cut set small enough?
So either v “forced”, or we have hitting set of suitable size.Notice that we arrive at either situation in polynomial time.
![Page 159: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/159.jpg)
forest
hitting set that excludes v
v
![Page 160: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/160.jpg)
forest
hitting set that excludes v
v
![Page 161: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/161.jpg)
forest
hitting set that excludes v
v
![Page 162: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/162.jpg)
forest
hitting set that excludes v
v
![Page 163: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/163.jpg)
forest
hitting set that excludes v
v
![Page 164: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/164.jpg)
forest
hitting set that excludes v
v
![Page 165: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/165.jpg)
forest
hitting set that excludes v
v
![Page 166: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/166.jpg)
forest
hitting set that excludes v
v
![Page 167: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/167.jpg)
forest
hitting set that excludes v
v
![Page 168: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/168.jpg)
forest
hitting set that excludes v
v
![Page 169: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/169.jpg)
forest
hitting set that excludes v
v
by 2-expansion
lemma:
![Page 170: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/170.jpg)
forest
hitting set that excludes v
v
by 2-expansion
lemma:
![Page 171: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/171.jpg)
forest
hitting set that excludes v
v
by 2-expansion
lemma:
![Page 172: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/172.jpg)
forest
hitting set that excludes v
v
![Page 173: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/173.jpg)
UPPER BO
UN
DS
e Forward Direction
FVS 6 k in G⇒ FVS 6 k in H
![Page 174: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/174.jpg)
UPPER BO
UN
DS
e Forward Direction
FVS 6 k in G⇒ FVS 6 k in H
![Page 175: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/175.jpg)
UPPER BO
UN
DS
If G has a FVS that either contains v or all of S, we are in good shape.
![Page 176: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/176.jpg)
UPPER BO
UN
DS
Consider now a FVS that:• Does not contain v,• and omits at least one vertex of S.
![Page 177: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/177.jpg)
![Page 178: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/178.jpg)
![Page 179: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/179.jpg)
![Page 180: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/180.jpg)
UPPER BO
UN
DS
Notice that this does not lead to a larger FVS:
For every vertex v in S that a FVS of G leaves out,
it must pick a vertex u that kills no more than all of S.
![Page 181: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/181.jpg)
UPPER BO
UN
DS
Notice that this does not lead to a larger FVS:
For every vertex v in S that a FVS of G leaves out,
it must pick a vertex u that kills no more than all of S.
![Page 182: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/182.jpg)
UPPER BO
UN
DS
Notice that this does not lead to a larger FVS:
For every vertex v in S that a FVS of G leaves out,
it must pick a vertex u that kills no more than all of S.
![Page 183: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/183.jpg)
UPPER BO
UN
DS
e Reverse Direction
FVS 6 k in G⇐ FVS 6 k in H
![Page 184: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/184.jpg)
UPPER BO
UN
DS
e Reverse Direction
FVS 6 k in G⇐ FVS 6 k in H
![Page 185: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/185.jpg)
forest
hitting set that excludes v
v
![Page 186: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/186.jpg)
UPPER BO
UN
DS
e Only Danger
Cycles that:
• pass through v,• non-neighbors of v in H¹• and do not pass through S.
¹neighbors in G, however
![Page 187: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/187.jpg)
![Page 188: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/188.jpg)
![Page 189: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/189.jpg)
UPPER BO
UN
DS
.
..
Feedback Vertex Set
Having worked out the details, it turns out that verticeswhose degree is more than 8k can be handled, so this
leads to an O(k2) kernel.
![Page 190: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/190.jpg)
LOW
ER BO
UN
DS
Demonstrating non-existence ofPolynomial Kernels
![Page 191: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/191.jpg)
LOW
ER BO
UN
DS
Consider a number of instances of the boolean satisfiability problem:
Let’s say all instances are of size n
(
φ1
, p)
, , p)
(
φ2
, p)
, , p)
(
φ3
, p)
, , p) . . . , p), , p)
(
φt
, p)
Can we come up with a formula ψ that is equivalent to:
(
φ1
, p)
∨ , p)
(
φ2
, p)
∨ , p)
(
φ3
, p)
∨ , p) . . . , p)∨ , p)
(
φt
, p)
Polynomial in n, and independent of tIf we can write a long formula ψ: we cannot simplify it, because:
It turns out that:
a short
ψ cannot be obtained in polynomial time.
![Page 192: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/192.jpg)
LOW
ER BO
UN
DS
Consider a number of instances of the boolean satisfiability problem:
Let’s say all instances are of size n
(
φ1
, p)
, , p)
(
φ2
, p)
, , p)
(
φ3
, p)
, , p) . . . , p), , p)
(
φt
, p)
Can we come up with a short formula ψ that is equivalent to:
(
φ1
, p)
∨ , p)
(
φ2
, p)
∨ , p)
(
φ3
, p)
∨ , p) . . . , p)∨ , p)
(
φt
, p)
Polynomial in n, and independent of tIf we can write a long formula ψ: we cannot simplify it, because:
It turns out that:
a short
ψ cannot be obtained in polynomial time.
![Page 193: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/193.jpg)
LOW
ER BO
UN
DS
Consider a number of instances of the boolean satisfiability problem:
Let’s say all instances are of size n
(
φ1
, p)
, , p)
(
φ2
, p)
, , p)
(
φ3
, p)
, , p) . . . , p), , p)
(
φt
, p)
Can we come up with a short formula ψ that is equivalent to:
(
φ1
, p)
∨ , p)
(
φ2
, p)
∨ , p)
(
φ3
, p)
∨ , p) . . . , p)∨ , p)
(
φt
, p)
Polynomial in n, and independent of t
If we can write a long formula ψ: we cannot simplify it, because:
It turns out that:
a short
ψ cannot be obtained in polynomial time.
![Page 194: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/194.jpg)
LOW
ER BO
UN
DS
Consider a number of instances of the boolean satisfiability problem:
Let’s say all instances are of size n
(
φ1
, p)
, , p)
(
φ2
, p)
, , p)
(
φ3
, p)
, , p) . . . , p), , p)
(
φt
, p)
Can we come up with a short formula ψ that is equivalent to:
(
φ1
, p)
∨ , p)
(
φ2
, p)
∨ , p)
(
φ3
, p)
∨ , p) . . . , p)∨ , p)
(
φt
, p)
Polynomial in n, and independent of t
If we can write a long formula ψ: we cannot simplify it, because:
It turns out that:
a short
ψ cannot be obtained in polynomial time.
![Page 195: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/195.jpg)
LOW
ER BO
UN
DS
Consider a number of instances of the boolean satisfiability problem:
Let’s say all instances are of size n
(φ1, p), , p)(φ2, p), , p)(φ3, p), , p) . . . , p), , p)(φt, p)
Can we come up with a short formula ψ that is equivalent to:
(φ1, p)∨ , p)(φ2, p)∨ , p)(φ3, p)∨ , p) . . . , p)∨ , p)(φt, p)
Polynomial in n, and independent of tIf we can write a long formula ψ: we cannot simplify it, because:
It turns out that:
a short
ψ cannot be obtained in polynomial time.
![Page 196: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/196.jpg)
LOW
ER BO
UN
DS
Consider a number of instances of the boolean satisfiability problem:
Let’s say all instances are of size n
(φ1, p), , p)(φ2, p), , p)(φ3, p), , p) . . . , p), , p)(φt, p)
Can we come up with a short formula ψ that is equivalent to:
(φ1, p)∨ , p)(φ2, p)∨ , p)(φ3, p)∨ , p) . . . , p)∨ , p)(φt, p)
Polynomial in n, and independent of t
If we can write a long formula ψ: we cannot simplify it, because:
It turns out that: a short ψ cannot be obtained in polynomial time.
![Page 197: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/197.jpg)
LOW
ER BO
UN
DS
A composition algorithm A for a problem is designed to act as a fastBoolean OR of multiple problem-instances.
It receives as input a sequence of instances.x = (x1, . . . , xt) with xi ∈ {0, 1}∗ for i ∈ [t], such that
(k1 = k2 = · · · = kt = k)
It produces as output a yes-instance with a small parameter if and only ifat least one of the instances in the sequences is also a yes-instance.
κ(A(x)) = kO(1)
Running time polynomial in Σi∈[t]|xi|
![Page 198: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/198.jpg)
LOW
ER BO
UN
DS
A composition algorithm A for a problem is designed to act as a fastBoolean OR of multiple problem-instances.
It receives as input a sequence of instances.x = (x1, . . . , xt) with xi ∈ {0, 1}∗ for i ∈ [t], such that
k1 = k2 = · · · = kt = k
It produces as output a yes-instance with a small parameter if and only ifat least one of the instances in the sequences is also a yes-instance.
κ(A(x)) = kO(1)
Running time polynomial in Σi∈[t]|xi|
![Page 199: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/199.jpg)
LOW
ER BO
UN
DS
A composition algorithm A for a problem is designed to act as a fastBoolean OR of multiple problem-instances.
It receives as input a sequence of instances.x = (x1, . . . , xt) with xi ∈ {0, 1}∗ for i ∈ [t], such that
k1 = k2 = · · · = kt = k
It produces as output a yes-instance with a small parameter if and only ifat least one of the instances in the sequences is also a yes-instance.
k ′ = kO(1)
Running time polynomial in Σi∈[t]|xi|
![Page 200: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/200.jpg)
LOW
ER BO
UN
DS
A composition algorithm A for a problem is designed to act as a fastBoolean OR of multiple problem-instances.
It receives as input a sequence of instances.x = (x1, . . . , xt) with xi ∈ {0, 1}∗ for i ∈ [t], such that
k1 = k2 = · · · = kt = k
It produces as output a yes-instance with a small parameter if and only ifat least one of the instances in the sequences is also a yes-instance.
k ′ = kO(1)
Running time polynomial in Σi∈[t]|xi|
![Page 201: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/201.jpg)
LOW
ER BO
UN
DS
e Recipe for Hardness
Composition Algorithm + Polynomial Kernel
⇓Distillation Algorithm
⇓PH = Σp
3
![Page 202: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/202.jpg)
LOW
ER BO
UN
DS
e Recipe for Hardness
Composition Algorithm + Polynomial Kernel
⇓Distillation Algorithm
⇓PH = Σp
3
![Page 203: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/203.jpg)
LOW
ER BO
UN
DS
eorem. Let (P, k) be a compositional parameterized problem such thatP is NP-complete. If P has a polynomial kernel, then P also has adistillation algorithm.
![Page 204: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/204.jpg)
LOW
ER BO
UN
DS
Transformations
Let (P, κ) and (Q,γ) be parameterized problems.
We say that there is a polynomial parameter transformation from P toQ ifthere exists a polynomial time computable function f : {0, 1}∗ −→ {0, 1}∗,and a polynomial p : N → N, such that, if f(x) = y, we have:
x ∈ P if and only if y ∈ Q,
and
γ(y) 6 p(κ(x))
![Page 205: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/205.jpg)
LOW
ER BO
UN
DS
Transformations
Let (P, κ) and (Q,γ) be parameterized problems.
We say that there is a polynomial parameter transformation from P toQ ifthere exists a polynomial time computable function f : {0, 1}∗ −→ {0, 1}∗,and a polynomial p : N → N, such that, if f(x) = y, we have:
x ∈ P if and only if y ∈ Q,
and
γ(y) 6 p(κ(x))
![Page 206: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/206.jpg)
LOW
ER BO
UN
DS
eorem: Suppose P is NP-complete, and Q ∈ NP. If f is a polynomialtime and parameter transformation from P to Q and Q has a polynomialkernel, then P has a polynomial kernel.
..
.f(x) = y
Instance of Q.
K(y)
.z ∈ P
.PPT Reduction
.NP–completeness
Reduction
.Kernelization
.x
Instance of P
![Page 207: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/207.jpg)
LOW
ER BO
UN
DS
eorem: Suppose P is NP-complete, and Q ∈ NP. If f is a polynomialtime and parameter transformation from P to Q and Q has a polynomialkernel, then P has a polynomial kernel.
..
.f(x) = y
Instance of Q.
K(y)
.z ∈ P
.PPT Reduction
.NP–completeness
Reduction
.Kernelization
.x
Instance of P
![Page 208: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/208.jpg)
LOW
ER BO
UN
DS
Recall
A composition for a parameterized language (Q, κ) is required to“merge” instances
x1, x2, . . . , xt,
into a single instance x in polynomial time, such that κ(x) is polynomialin k := κ(xi) for any i.
..e output of the algorithm belongs to(Q,κ(x))
if, and only ifthere exists at least one i ∈ [t] for which xi ∈ (Q,κ).
![Page 209: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/209.jpg)
LOW
ER BO
UN
DS
k-Path
![Page 210: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/210.jpg)
LOW
ER BO
UN
DS
k-Path
![Page 211: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/211.jpg)
LOW
ER BO
UN
DS
Boolean satisfiability
φ1
∨
φ2
∨
φ3
∨
φ4
∨
φ5
![Page 212: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/212.jpg)
LOW
ER BO
UN
DS
Boolean satisfiability
φ1 ∨ φ2 ∨ φ3 ∨ φ4 ∨ φ5
![Page 213: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/213.jpg)
LOW
ER BO
UN
DS
Weighted SatisfiabilityGiven a CNF formula φ,
Is there a satisfying assignment of weight at most k?
Parameter: b+k.When the length of the longest clause is bounded by b,
there is an easy branching algorithm with runtime O(bk · p(n)).
![Page 214: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/214.jpg)
LOW
ER BO
UN
DS
Weighted SatisfiabilityGiven a CNF formula φ,
Is there a satisfying assignment of weight at most k?
Parameter: b+k.When the length of the longest clause is bounded by b,
there is an easy branching algorithm with runtime O(bk · p(n)).
![Page 215: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/215.jpg)
LOW
ER BO
UN
DS
Weighted Satisfiability.
.|bp(n)|||d|)
Given a CNF formula φ,Is there a satisfying assignment of weight at most k?
Parameter: b+k.When the length of the longest clause is bounded by b,
there is an easy branching algorithm with runtime O(bk · p(n)).
![Page 216: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/216.jpg)
LOW
ER BO
UN
DS
Input: α1, α2, . . . , αt.
κ(αi) = b+ k.n := maxi∈[n] ni
If t > bk, then solve every αi individually.
Total time = t · bk · p(n)
If not, t < bk – this gives us a bound on the number of instances.
![Page 217: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/217.jpg)
LOW
ER BO
UN
DS
Input: α1, α2, . . . , αt.κ(αi) = b+ k.
n := maxi∈[n] ni
If t > bk, then solve every αi individually.
Total time = t · bk · p(n)
If not, t < bk – this gives us a bound on the number of instances.
![Page 218: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/218.jpg)
LOW
ER BO
UN
DS
Input: α1, α2, . . . , αt.κ(αi) = b+ k.n := maxi∈[n] ni
If t > bk, then solve every αi individually.
Total time = t · bk · p(n)
If not, t < bk – this gives us a bound on the number of instances.
![Page 219: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/219.jpg)
LOW
ER BO
UN
DS
Input: α1, α2, . . . , αt.κ(αi) = b+ k.n := maxi∈[n] ni
If t > bk, then solve every αi individually.
Total time = t · bk · p(n)
If not, t < bk – this gives us a bound on the number of instances.
![Page 220: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/220.jpg)
LOW
ER BO
UN
DS
Input: α1, α2, . . . , αt.κ(αi) = b+ k.n := maxi∈[n] ni
If t > bk, then solve every αi individually.
Total time = t · bk · p(n)Total time = t · bk · p(n)
If not, t < bk – this gives us a bound on the number of instances.
![Page 221: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/221.jpg)
LOW
ER BO
UN
DS
Input: α1, α2, . . . , αt.κ(αi) = b+ k.n := maxi∈[n] ni
If t > bk, then solve every αi individually.
Total time = t · bk · p(n)Total time < t · t · p(n)
If not, t < bk – this gives us a bound on the number of instances.
![Page 222: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/222.jpg)
LOW
ER BO
UN
DS
Input: α1, α2, . . . , αt.κ(αi) = b+ k.n := maxi∈[n] ni
If t > bk, then solve every αi individually.
Total time = t · bk · p(n)Total time < t · t · p(n)
If not, t < bk – this gives us a bound on the number of instances.
![Page 223: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/223.jpg)
LOW
ER BO
UN
DS
..Level 1
.(β1 ∨ b0)∧ . . .∧ (βn ∨ b0) .(β ′1 ∨ b0)∧ . . .∧ (β ′
m ∨ b0)
is is the scene at the leaves, where the βjs are the clauses in αi forsome i and the β ′
js are clauses of αi+1.
![Page 224: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/224.jpg)
LOW
ER BO
UN
DS
..Level j
.(β1 ∨ b)∧ . . .∧ (βn ∨ b) .(β ′1 ∨ b)∧ . . .∧ (β ′
m ∨ b)
is is the scene at the leaves, where the βjs are the clauses in αi forsome i and the β ′
js are clauses of αi+1.
![Page 225: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/225.jpg)
LOW
ER BO
UN
DS
..(β1 ∨ b)∧ (β2 ∨ b)∧ . . .∧ (βn ∨ b) ∧
(β ′1 ∨ b)∧ (β ′
2 ∨ b)∧ . . .∧ (β ′m ∨ b)
.(β1 ∨ b)∧ . . .∧ (βn ∨ b) .(β ′1 ∨ b)∧ . . .∧ (β ′
m ∨ b)
Take the conjunction of the formulas stored at the child nodes.Take the conjunction of the formulas stored at the child nodes.
![Page 226: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/226.jpg)
LOW
ER BO
UN
DS
..(β1 ∨ b∨ bj)∧ (β2 ∨ b∨ bj)∧ . . .∧ (βn ∨ b∨ bj)∧
(β ′1 ∨ b∨ bj)∧ (β ′
2 ∨ b∨ bj)∧ . . .∧ (β ′m ∨ b∨ bj)
.(β1 ∨ b)∧ . . .∧ (βn ∨ b) .(β ′1 ∨ b)∧ . . .∧ (β ′
m ∨ b)
where the βjs are the clauses in αi for some i and the.if the parent is a “left child”.
![Page 227: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/227.jpg)
LOW
ER BO
UN
DS
..(β1 ∨ b∨ bj)∧ (β2 ∨ b∨ bj)∧ . . .∧ (βn ∨ b∨ bj)∧
(β ′1 ∨ b∨ bj)∧ (β ′
2 ∨ b∨ bj)∧ . . .∧ (β ′m ∨ b∨ bj)
.(β1 ∨ b)∧ . . .∧ (βn ∨ b) .(β ′1 ∨ b)∧ . . .∧ (β ′
m ∨ b)
where the βjs are the clauses in αi for some i and the.if the parent is a “right child”.
![Page 228: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/228.jpg)
LOW
ER BO
UN
DS
adding a suffix to “control the weight”
α
∧
(c0 ∨ b0)∧ (c0 ∨ b0)∧
(c1 ∨ b1)∧ (c1 ∨ b1)∧
. . .
(ci ∨ bi)∧ (ci ∨ bi)∧
. . .
(cl−1 ∨ bl−1)∧ (cl−1 ∨ bl−1)
![Page 229: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/229.jpg)
LOW
ER BO
UN
DS
Claim
e composed instance α has a satisfying assignment of weight 2k
⇐⇒at least one of the input instances admit a satisfying assignment of
weight k.
![Page 230: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/230.jpg)
LOW
ER BO
UN
DS
Proof of Correctness
... . .∧ (α∨ (b0 ∨ b1 ∨ b2))∧ . . .
.. . . α∨ b0 ∨ b1∨b2. . .
.. . . α∨ b0∨ b1. . .
.. . . α ∨ b0 . . .
![Page 231: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/231.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Are there k disjoint factors?
Does the word have all the k factors, mutually disjoint?
![Page 232: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/232.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Are there k disjoint factors?
Does the word have all the k factors, mutually disjoint?
![Page 233: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/233.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Are there k disjoint factors?
Does the word have all the k factors, mutually disjoint?
![Page 234: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/234.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Are there k disjoint factors?
Does the word have all the k factors, mutually disjoint?
![Page 235: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/235.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Are there k disjoint factors?
Does the word have all the k factors, mutually disjoint?
![Page 236: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/236.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Are there k disjoint factors?
Does the word have all the k factors, mutually disjoint?
![Page 237: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/237.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Are there k disjoint factors?
Does the word have all the k factors, mutually disjoint?
![Page 238: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/238.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Are there k disjoint factors?
Does the word have all the k factors, mutually disjoint?
![Page 239: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/239.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Are there k disjoint factors?
Does the word have all the k factors, mutually disjoint?
![Page 240: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/240.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Does the word have all the k factors, mutually disjoint?Does the word have all the k factors, mutually disjoint?
![Page 241: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/241.jpg)
LOW
ER BO
UN
DS
Disjoint FactorsLet Lk be the alphabet consisting of the letters {1, 2, . . . , k}.
A factor of a word w1 · · ·wr ∈ L∗k is a substring wi · · ·wj ∈ L∗k, with1 6 i < j 6 r, which starts and ends with the same letter.
123235443513
Disjoint factors do not overlap in the word.Does the word have all the k factors, mutually disjoint?
Parameter: k
![Page 242: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/242.jpg)
LOW
ER BO
UN
DS
A k! · O(n) algorithm is immediate.
A 2k · p(n) algorithm can be obtained by Dynamic Programming.
Let t be the number of instances input to the composition algorithm.Again, the non-trivial case is when t < 2k.
Let w1, w2, . . . , wt be words over L∗k.
![Page 243: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/243.jpg)
LOW
ER BO
UN
DS
A k! · O(n) algorithm is immediate.A 2k · p(n) algorithm can be obtained by Dynamic Programming.
Let t be the number of instances input to the composition algorithm.Again, the non-trivial case is when t < 2k.
Let w1, w2, . . . , wt be words over L∗k.
![Page 244: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/244.jpg)
LOW
ER BO
UN
DS
A k! · O(n) algorithm is immediate.A 2k · p(n) algorithm can be obtained by Dynamic Programming.
Let t be the number of instances input to the composition algorithm.Again, the non-trivial case is when t < 2k.
Let w1, w2, . . . , wt be words over L∗k.
![Page 245: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/245.jpg)
LOW
ER BO
UN
DS
A k! · O(n) algorithm is immediate.A 2k · p(n) algorithm can be obtained by Dynamic Programming.
Let t be the number of instances input to the composition algorithm.Again, the non-trivial case is when t < 2k.
Let w1, w2, . . . , wt be words over L∗k.
![Page 246: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/246.jpg)
LOW
ER BO
UN
DS
..Leaf Nodes
.b0w1b0 .b0w2b0 .. . . .b0wt−1b0 .b0wtb0
![Page 247: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/247.jpg)
LOW
ER BO
UN
DS
Level j.
..bjbj−1ubj−1vbj−1bj
.bj−1ubj−1 .bj−1vbj−1
![Page 248: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/248.jpg)
LOW
ER BO
UN
DS
Claim
e composed word has all the 2k disjoint factors
⇐⇒at least one of the input instances has all the k disjoint factors.
![Page 249: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/249.jpg)
LOW
ER BO
UN
DS
Proof of Correctness
..b2b1b0pb0qb0b1b0rb0sb0b1b2b1b0wb0xb0b1b0yb0zb0b1b2
.b2b1b0pb0qb0b1b0rb0sb0b1b2
.b1b0pb0qb0b1
.b0pb0 .b0qb0
.b1b0rb0sb0b1
.b0rb0 .b0sb0
.b2b1b0wb0xb0b1b0yb0zb0b1b2
.b1b0wb0xb0b1
.b0wb0 .b0xb0
.b1b0pyb0zb0b1
.b0yb0 .b0zb0
Input words: p, q, r, s,w, x, y, z.
![Page 250: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/250.jpg)
LOW
ER BO
UN
DS
Proof of Correctness
..b2b1b0pb0qb0b1b0rb0sb0b1b2b1b0wb0xb0b1b0yb0zb0b1b2
.b2b1b0pb0qb0b1b0rb0sb0b1b2
.b1b0pb0qb0b1
.b0pb0 .b0qb0
.b1b0rb0sb0b1
.b0rb0 .b0sb0
.b2b1b0wb0xb0b1b0yb0zb0b1b2
.b1b0wb0xb0b1
.b0wb0 .b0xb0
.b1b0pyb0zb0b1
.b0yb0 .b0zb0
Input words: p, q, r, s,w, x, y, z.
![Page 251: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/251.jpg)
LOW
ER BO
UN
DS
Proof of Correctness
..b2b1b0pb0qb0b1b0rb0sb0b1b2b1b0wb0xb0b1b0yb0zb0b1b2
.b2b1b0pb0qb0b1b0rb0sb0b1b2
.b1b0pb0qb0b1
.b0pb0 .b0qb0
.b1b0rb0sb0b1
.b0rb0 .b0sb0
.b2b1b0wb0xb0b1b0yb0zb0b1b2
.b1b0wb0xb0b1
.b0wb0 .b0xb0
.b1b0pyb0zb0b1
.b0yb0 .b0zb0
Input words: p, q, r, s,w, x, y, z.
![Page 252: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/252.jpg)
LOW
ER BO
UN
DS
Proof of Correctness
..b2b1b0pb0qb0b1b0rb0sb0b1b2b1b0wb0xb0b1b0yb0zb0b1b2
.b2b1b0pb0qb0b1b0rb0sb0b1b2
.b1b0pb0qb0b1
.b0pb0 .b0qb0
.b1b0rb0sb0b1
.b0rb0 .b0sb0
.b2b1b0wb0xb0b1b0yb0zb0b1b2
.b1b0wb0xb0b1
.b0wb0 .b0xb0
.b1b0pyb0zb0b1
.b0yb0 .b0zb0
Input words: p, q, r, s,w, x, y, z.
![Page 253: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/253.jpg)
LOW
ER BO
UN
DS
Vertex-Disjoint Cycles
Input: G = (V, E)
Question: Are there k vertex–disjoint cycles?Parameter: k.
Related problems:FVS, has a O(k2) kernel.Edge–Disjoint Cycles, has a O(k2 log2 k) kernel.
![Page 254: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/254.jpg)
LOW
ER BO
UN
DS
Vertex-Disjoint Cycles
Input: G = (V, E)
Question: Are there k vertex–disjoint cycles?
Parameter: k.
Related problems:FVS, has a O(k2) kernel.Edge–Disjoint Cycles, has a O(k2 log2 k) kernel.
![Page 255: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/255.jpg)
LOW
ER BO
UN
DS
Vertex-Disjoint Cycles
Input: G = (V, E)
Question: Are there k vertex–disjoint cycles?Parameter: k.
Related problems:FVS, has a O(k2) kernel.Edge–Disjoint Cycles, has a O(k2 log2 k) kernel.
![Page 256: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/256.jpg)
LOW
ER BO
UN
DS
Vertex-Disjoint Cycles
Input: G = (V, E)
Question: Are there k vertex–disjoint cycles?Parameter: k.
Related problems:FVS, has a O(k2) kernel.Edge–Disjoint Cycles, has a O(k2 log2 k) kernel.
![Page 257: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/257.jpg)
LOW
ER BO
UN
DS
Vertex-Disjoint Cycles
Input: G = (V, E)
Question: Are there k vertex–disjoint cycles?Parameter: k.
Related problems:FVS, has a O(k2) kernel.Edge–Disjoint Cycles, has a O(k2 log2 k) kernel.
![Page 258: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/258.jpg)
LOW
ER BO
UN
DS
In contrast, Disjoint Factors transforms into Vertex–Disjoint Cycles inpolynomial time.
![Page 259: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/259.jpg)
LOW
ER BO
UN
DS
.
.w = 1123343422
.v1 .v2 .v3 .v4 .v5 .v6 .v7 .v8 .v9 .v10.1 .1 .2 .3 .3 .4 .3 .4 .2 .2
.1 .2 .3 .4
Disjoint Factors 4ppt Disjoint Cycles
![Page 260: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/260.jpg)
LOW
ER BO
UN
DS
.
.w = 1123343422
.v1 .v2 .v3 .v4 .v5 .v6 .v7 .v8 .v9 .v10.1 .1 .2 .3 .3 .4 .3 .4 .2 .2
.1 .2 .3 .4
w has all k disjoint factors ⇐⇒ Gw has k vertex–disjoint cycles.
![Page 261: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/261.jpg)
STORIES FOR ANOTHER DAY
Colors and IDs
(Advanced techniques for the design of composition algorithms.)
![Page 262: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/262.jpg)
STORIES FOR ANOTHER DAY
Colors and IDs
(Advanced techniques for the design of composition algorithms.)
![Page 263: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/263.jpg)
STORIES FOR ANOTHER DAY
Finer lower bounds on kernel size.
![Page 264: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/264.jpg)
STORIES FOR ANOTHER DAY
Dealing with “hardness” of polynomial kernelization.
(Many poly kernels, approximative kernels, randomized kernels, etc.)
![Page 265: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/265.jpg)
STORIES FOR ANOTHER DAY
Dealing with “hardness” of polynomial kernelization.
(Many poly kernels, approximative kernels, randomized kernels, etc.)
![Page 266: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/266.jpg)
STORIES FOR ANOTHER DAY
For the many problems whose kernelization complexity is unkown,prove positive or negative results.
(Odd Cycle Traversal, Feedback Vertex Set on Directed Graphs)
![Page 267: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/267.jpg)
STORIES FOR ANOTHER DAY
For the many problems whose kernelization complexity is unkown,prove positive or negative results.
(Odd Cycle Traversal, Feedback Vertex Set on Directed Graphs)
![Page 268: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/268.jpg)
STORIES FOR ANOTHER DAY
Discover implications of the AND conjecture, and other ways ofshowing lower bounds.
![Page 269: Efficient Simplification: The (im)possibilities](https://reader034.vdocuments.us/reader034/viewer/2022042623/55388bc7550346e0428b47b0/html5/thumbnails/269.jpg)
FIN