The Kernelization complexity of some domination and covering problems [HBNI Th 44]

DSpace/Manakin Repository

The Kernelization complexity of some domination and covering problems [HBNI Th 44]

Show full item record

Title: The Kernelization complexity of some domination and covering problems [HBNI Th 44]
Author: Geevarghese Philip
Advisor: Venkatesh Raman
Degree: Ph.D
Main Subjects: Computer Science
Institution: HBNI
Year: 2011
Pages: 160p.
Abstract: Polynomial-time preprocessing is a simple algorithmic strategy which has been widely employed in practice to tackle hard problems. The quantification and analysis of the efficiency of preprocessing algorithms are, in a certain precise sense, outside the pale of classical complexity theory. The notion of kernelization from parameterized complexity theory provides a framework for the mathematical analysis of polynomial-time preprocessing algorithms. Both kernelization and the closely related notion of fixed-parameter tractable (FPT) algorithms are very active areas of current research. In this thesis we describe the results of our study of the kernelization complexity of some graph domination and covering problems.
URI: http://hdl.handle.net/123456789/274

Files in this item

Files Size Format View
HBNI Th44 TCS.pdf 1.482Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Search DSpace


Advanced Search

Browse

My Account