A kernelization algorithm for d-Hitting Set
For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). The resulting instance is called a problem kernel. In this paper, a kerne...
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Published: |
2010
|
| Online Access: | http://hdl.handle.net/10725/2772 http://dx.doi.org/10.1016/j.jcss.2009.09.002 http://www.sciencedirect.com/science/article/pii/S0022000009000786 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!