Kernelization of Packing Problems

by   Holger Dell, et al.

Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d>2 is the problem of finding a matching of size at least k in a given d-uniform hypergraph and has kernels with O(k^d) edges. Bodlaender et al. [JCSS 2009], Fortnow and Santhanam [JCSS 2011], Dell and Van Melkebeek [JACM 2014] developed a framework for proving lower bounds on the kernel size for certain problems, under the complexity-theoretic hypothesis that coNP is not contained in NP/poly. Under the same hypothesis, we show tight lower bounds for the kernelization of d-Set Matching and other packing problems. Our bounds are tight for d-Set Matching: It does not have kernels with O(k^d-ϵ) edges for any ϵ>0 unless the hypothesis fails. By reduction, this transfers to a bound of O(k^d-1-ϵ) for the problem of finding k vertex-disjoint cliques of size d in standard graphs. Obtaining tight bounds for graph packing problems is challenging: We make first progress in this direction by showing non-trivial kernels with O(k^2.5) edges for the problem of finding k vertex-disjoint paths of three edges each. If the paths have d edges each, we improve the straightforward O(k^d+1) kernel to a uniform polynomial kernel where the exponent of the kernel size is independent of k. Most of our lower bound proofs follow a general scheme that we discover: To exclude kernels of size O(k^d-ϵ) for a problem in d-uniform hypergraphs, one should reduce from a carefully chosen d-partite problem that is still NP-hard. As an illustration, we apply this scheme to the vertex cover problem, which allows us to replace the number-theoretical construction by Dell and Van Melkebeek [JACM 2014] with shorter elementary arguments.


page 1

page 2

page 3

page 4


Min-Max Theorems for Packing and Covering Odd (u,v)-trails

We investigate the problem of packing and covering odd (u,v)-trails in a...

A 5k-vertex Kernel for P_2-packing

The P_2-packing problem asks for whether a graph contains k vertex-disjo...

Kernelization of Maximum Minimal Vertex Cover

In the Maximum Minimal Vertex Cover (MMVC) problem, we are given a graph...

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

We solve the Bin Packing problem in O^*(2^k) time, where k is the number...

Advice Complexity of Priority Algorithms

The priority model of "greedy-like" algorithms was introduced by Borodin...

Essentially Tight Kernels for (Weakly) Closed Graphs

We study kernelization of classic hard graph problems when the input gra...

Algorithmic aspects of quasi-kernels

In a digraph, a quasi-kernel is a subset of vertices that is independent...

Please sign up or login with your details

Forgot password? Click here to reset