3. Vertex Cover
Feedback Vertex Set
Max Sat
Odd Cycle Transversal
Point Line Cover
Feedback Arc Set on
Tournaments
3-Hitting Set
Closest String
d-Clustering
4. Vertex Cover
Feedback Vertex Set
Max Sat
Odd Cycle Transversal
Point Line Cover
Feedback Arc Set on
Tournaments
3-Hitting Set
Closest String
d-Clustering
f(k)
n
5. Vertex Cover
Feedback Vertex Set
Max Sat
O(1)
Odd Cycle Transversal
Point Line Cover
Feedback Arc Set on
Tournaments
3-Hitting Set
Closest String
d-Clustering
f(k) n
19. (x, k)
(x , k )
A known
“hard” problem
Instance of
“your problem”
solveClique{
blah
blah
!
}
20. (x, k)
(x , k )
A known
“hard” problem
Instance of
“your problem”
solveClique{
blah
blah
!
}
The reduction itself must run in FPT time.
21. (x, k)
(x , k )
A known
“hard” problem
Instance of
“your problem”
solveClique{
blah
blah
!
}
The reduction itself must run in FPT time.
The time taken to solve the generated instance will be
f(k )p(|x |)
22. (x, k)
(x , k )
A known
“hard” problem
Instance of
“your problem”
solveClique{
blah
blah
!
}
The reduction itself must run in FPT time.
So the parameter of the output is constrained to
being a function of the original parameter.
