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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 76; no. 7; pp. 524 - 531
Main Author:	Abu-Khzam, Faisal N.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2010
Subjects:	Algorithms Crown decomposition Equivalence Fixed-parameter algorithms Hitting Set Hypergraphs Kernelization Kernels Transforms Vertex cover Crown decomposition Vertex cover Hitting Set Fixed-parameter algorithms Hypergraphs Kernelization
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!