Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

We obtain faster algorithms for problems such as r -dimensional matching and r -set packing when the size k of the solution is considered a parameter. We first establish a general framework for finding and exploiting small problem kernels (of size polynomial in k ). This technique lets us combine Al...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 52; no. 2; pp. 167 - 176
Main Authors:	Fellows, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D. M., Whitesides, S.
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.10.2008
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Fixed parameter tractable Parameterized complexity Set packing Graph matching Color coding
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!