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 ( k r − 1 ) , where k is the input parameter. Such parameterized reductions are known as kernelization algorithms, and a reduced instanc...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 110; no. 16; pp. 621 - 624
Main Author:	Abu-Khzam, Faisal N.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 31.07.2010 Elsevier Elsevier Sequoia S.A
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Crown decomposition Designs and configurations Equivalence Exact sciences and technology Fixed-parameter algorithms Graph algorithms Kernelization Kernels Mathematics Miscellaneous Packing problem Reduction Sciences and techniques of general use Set Packing Studies Theoretical computing Crown decomposition Fixed-parameter algorithms Graph algorithms Set Packing Kernelization Computer theory Decomposition method Input Packing Information processing Procedure Algorithm analysis Graph algorithm
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!