An improved kernelization algorithm for r-Set Packing
We present a reduction procedure that takes an arbitrary instance of the r -Set Packing problem and produces an equivalent instance whose number of elements is in O(kr−1), where k is the input parameter. Such parameterized reductions are known as kernelization algorithms, and a reduced instance is c...
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Published: |
2010
|
| Online Access: | http://hdl.handle.net/10725/2781 http://dx.doi.org/10.1016/j.ipl.2010.04.020 http://www.sciencedirect.com/science/article/pii/S0020019010001018 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|