Parameterization above a multiplicative guarantee

Fomin, Fedor V and Golovach, P A and Panolan, Fahad and et al, . (2020) Parameterization above a multiplicative guarantee. In: 11th Innovations in Theoretical Computer Science Conference, ITCS, 12-14 January 2020, Seattle, United States.

Full text not available from this repository. (Request a copy)

Abstract

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 introduction in 1999 for Max SAT and Max Cut (with g(I) being half the number of clauses and half the number of edges, respectively, in the input), analysis of parameterization above a guarantee has become a very active and fruitful topic of research. We highlight a multiplicative form of parameterization above a guarantee: Given an instance (I, k) of some (parameterized) problem Π with a guarantee g(I), decide whether I admits a solution of size at least (resp. at most) k·g(I). In particular, we study the Long Cycle problem with a multiplicative parameterization above the girth g(I) of the input graph, and provide a parameterized algorithm for this problem. Apart from being of independent interest, this exemplifies how parameterization above a multiplicative guarantee can arise naturally. We also show that, for any fixed constant > 0, multiplicative parameterization above g(I)1+ of Long Cycle yields para-NP-hardness, thus our parameterization is tight in this sense. We complement our main result with the design (or refutation of the existence) of algorithms for other problems parameterized multiplicatively above girth.

[error in script]

IITH Creators: