A general method to speed up fixed-parameter-tractable algorithms

A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k) as its input and has to decide whether (I,k)∈ L for some parameterized problem L . Many parameterized algorithms work in two stages: reduction to a problem kernel and bounded search tree. Their time complexity...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 73; no. 3; pp. 125 - 129
Main Authors:	Niedermeier, Rolf, Rossmanith, Peter
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 29.02.2000 Elsevier Science
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science; control theory; systems Decision theory. Utility theory Exact sciences and technology Operational research and scientific management Operational research. Management science Parameterized complexity Theoretical computing Parameterized complexity Algorithms Parmetrized complexity Reduction to problem kernel Fixed parameter tractable algorithm Search tree Acceleration Algorithm Computational complexity Time complexity
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!