Kernelization of Packing Problems

@inproceedings{Dell2012KernelizationOP,
  title={Kernelization of Packing Problems},
  author={Holger Dell and D{\'a}niel Marx},
  booktitle={SODA},
  year={2012}
}

• Holger Dell, Dániel Marx
• Published 2012 in SODA
• DOI:10.1137/1.9781611973099.6

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

Save to Library

Create Alert

Cite

View on ArXiv