A Hierarchy of Polynomial Kernels

02/28/2019
by   Jouke Witteveen, et al.
0

In parameterized algorithmics, the process of kernelization is defined as a polynomial time algorithm that transforms the instance of a given problem to an equivalent instance of a size that is limited by a function of the parameter. As, afterwards, this smaller instance can then be solved to find an answer to the original question, kernelization is often presented as a form of preprocessing. A natural generalization of kernelization is the process that allows for a number of smaller instances to be produced to provide an answer to the original problem, possibly also using negation. This generalization is called Turing kernelization. Immediately, questions of equivalence occur or, when is one form possible and not the other. These have been long standing open problems in parameterized complexity. In the present paper, we answer many of these. In particular, we show that Turing kernelizations differ not only from regular kernelization, but also from intermediate forms as truth-table kernelizations. We achieve absolute results by diagonalizations and also results on natural problems depending on widely accepted complexity theoretic assumptions. In particular, we improve on known lower bounds for the kernel size of compositional problems using these assumptions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2018

Reoptimization of Parameterized Problems

Parameterized complexity allows us to analyze the time complexity of pro...
research
08/24/2023

No Polynomial Kernels for Knapsack

This paper focuses on kernelization algorithms for the fundamental Knaps...
research
07/05/2023

Approximate Turing kernelization and lower bounds for domination problems

An α-approximate polynomial Turing kernelization is a polynomial-time al...
research
10/07/2021

Polynomial Turing Kernels for Clique with an Optimal Number of Queries

A polynomial Turing kernel for some parameterized problem P is a polynom...
research
10/20/2017

Kernelization Lower Bounds for Finding Constant Size Subgraphs

Kernelization is an important tool in parameterized algorithmics. The go...
research
01/17/2019

Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P

We focus our attention onto polynomial-time sub-linear-space computation...
research
03/04/2020

Scheduling Kernels via Configuration LP

Makespan minimization (on parallel identical or unrelated machines) is a...

Please sign up or login with your details

Forgot password? Click here to reset