A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Parameterization Above a Multiplicative Guarantee

2020
*
Innovations in Theoretical Computer Science
*

Parameterization above a guarantee is a successful paradigm in Parameterized Complexity. To the best of our knowledge, all fixed-parameter tractable problems in this paradigm share an additive form defined as follows. Given an instance (I, k) of some (parameterized) problem Π with a guarantee g(I), decide whether I admits a solution of size at least (at most) k + g(I). Here, g(I) is usually a lower bound (resp. upper bound) on the maximum (resp. minimum) size of a solution. Since its

doi:10.4230/lipics.itcs.2020.39
dblp:conf/innovations/FominGLP0Z20
fatcat:soqaonrddjeoljfyc6ce24s3ae