Kernelization of Packing Problems

  title={Kernelization of Packing Problems},
  author={Holger Dell and D{\'a}niel Marx},
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 ≥ 3 is the problem of finding a matching of size at least k in a given d-uniform hypergraph and has kernels with O(kd) 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… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 85 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 48 extracted citations

86 Citations

Citations per Year
Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.