Kernelization Lower Bounds for Finding Constant Size Subgraphs

10/20/2017
by   Till Fluschnik, et al.
0

Kernelization is an important tool in parameterized algorithmics. The goal is to reduce the input instance of a parameterized problem in polynomial time to an equivalent instance of the same problem such that the size of the reduced instance only depends on the parameter and not on the size of the original instance. In this paper, we provide a first conceptual study on limits of kernelization for several polynomial-time solvable problems. For instance, we consider the problem of finding a triangle with negative sum of edge weights parameterized by the maximum degree of the input graph. We prove that a linear-time computable strict kernel of truly subcubic size for this problem violates the popular APSP-conjecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2023

No Polynomial Kernels for Knapsack

This paper focuses on kernelization algorithms for the fundamental Knaps...
research
08/04/2023

Kernelization of Counting Problems

We introduce a new framework for the analysis of preprocessing routines ...
research
03/05/2023

Expansion Lemma – Variations and Applications to Polynomial-Time Preprocessing

In parameterized complexity, it is well-known that a parameterized probl...
research
04/28/2022

The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding

The increasing competition in digital advertising induced a proliferatio...
research
08/16/2022

Polynomial kernel for immersion hitting in tournaments

For a fixed simple digraph H without isolated vertices, we consider the ...
research
02/28/2019

A Hierarchy of Polynomial Kernels

In parameterized algorithmics, the process of kernelization is defined a...
research
07/15/2021

Lossy Kernelization of Same-Size Clustering

In this work, we study the k-median clustering problem with an additiona...

Please sign up or login with your details

Forgot password? Click here to reset