Techniques for designing fixed parameter algorithms

Author

Aravind Prasad, A.G. ; Shine, S.

Author_Institution

Dept. of Comput. Sci. & Eng., Coll. of Eng., Trivandrum, India

fYear

2014

fDate

10-11 July 2014

Firstpage

327

Lastpage

330

Abstract

Fixed parameter approach is one of the theoretically rich and useful design technique to deal with NP-completeness. It analizes running times both in terms of input size and the parameter. The fixed parameter O(1) tractable problems can be solved in time f (k)*n^O(1)(where n is the size of the given object) for some computable function f. Three design techniques: depth-bounded search trees, kernelization, and iterative compression to develop fixed parameter algorithms are surveyed in this paper. All techniques are described with respect to vertex cover problem.

Keywords

computational complexity; graph theory; tree searching; NP-completeness; depth-bounded search trees; fixed parameter algorithm design; fixed parameter approach; iterative compression; kernelization; vertex cover problem; Algorithm design and analysis; Approximation algorithms; Classification algorithms; Complexity theory; Computer science; Instruments; Polynomials; depth-bounded search trees; fixed-parameter tractable (fpt) algorithm; iterative compression; kernelization;

fLanguage

English

Publisher

ieee

Conference_Titel

Control, Instrumentation, Communication and Computational Technologies (ICCICCT), 2014 International Conference on

Conference_Location

Kanyakumari

Print_ISBN

978-1-4799-4191-9

Type

conf

DOI

10.1109/ICCICCT.2014.6992979

Filename

6992979