A quadratic kernel for 3-set packing
We present a reduction procedure that takes an arbitrary instance of the 3-Set Packing problem and produces an equivalent instance whose number of elements is bounded by a quadratic function of the input parameter. Such parameterized reductions are known as kernelization algorithms, and each reduced...
Saved in:
| Main Author: | |
|---|---|
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5403 http://dx.doi.org/110.1007/978-3-642-02017-9_11 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://link.springer.com/chapter/10.1007/978-3-642-02017-9_11 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|