A kernelization algorithm for d-Hitting Set
- 23 September 2009
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 76 (7), 524-531
- https://doi.org/10.1016/j.jcss.2009.09.002
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Crown Structures for Vertex Cover KernelizationTheory of Computing Systems, 2007
- Kernels: Annotated, Proper and InducedLecture Notes in Computer Science, 2006
- Interference in Cellular Networks: The Minimum Membership Set Cover ProblemLecture Notes in Computer Science, 2005
- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) StepsLecture Notes in Computer Science, 2004
- Test-suite reduction and prioritization for modified condition/decision coverageIEEE Transactions on Software Engineering, 2003
- An efficient fixed-parameter algorithm for 3-Hitting SetJournal of Discrete Algorithms, 2003
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975