MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket
dblp
dblp
dblp
dblp
Not MPG Author(s):
Fernau, Henning
Fomin, Fedor V.
Saurabh, Saket
Editor(s):
Thai, My T.
Sahni, Sartaj
dblp
dblp
Not MPII Editor(s):
Thai, My T.
Sahni, Sartaj
BibTeX cite key*:
FernauFominPhilipSaurabh2010
Title, Booktitle
Title*:
The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
cocoon088a.pdf (161.59 KB)
Booktitle*:
Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings
Event, URLs
Conference URL::
http://www.cise.ufl.edu/cocoon2010/
Downloading URL:
http://www.springerlink.com/content/u772m067xu8167ph/fulltext.pdf
Event Address*:
Nha Trang, Vietnam
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
19 July 2010
Event End Date:
21 July 2010
Publisher
Name*:
Springer
URL:
http://www.springer.com
Address*:
Berlin
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
6196
Number:
Month:
Pages:
34-43
Year*:
2010
VG Wort Pages:
ISBN/ISSN:
978-3-642-14030-3
Sequence Number:
DOI:
10.1007/978-3-642-14031-0
Note, Abstract, ©
(LaTeX) Abstract:
We investigate the effect of certain natural connectivity constraints
on the parameterized complexity of two fundamental graph covering
problems, namely Vertex Cover and Edge Cover. Specifically, we impose the
additional requirement that each connected component of a solution
have at least $t$ vertices (resp. edges from the solution), and call
the problem $t$-Total Vertex Cover (resp. $t$-Total Edge Cover). We show that
\begin{itemize}
\item both problems remain fixed-parameter tractable with these restrictions,
with running times of the form $\Oh^{*}\left(c^{k}\right)$ for some
constant $c>0$ in each case;
\item for every $t\ge2$,$t$-Total Vertex Cover has no polynomial kernel unless the
Polynomial Hierarchy collapses to the third level;
\item for every $t\ge2$, $t$-Total Edge Cover has a linear vertex kernel of size $\frac{t+1}{t}k$.
\end{itemize}
URL for the Abstract:
http://www.springerlink.com/content/u772m067xu8167ph/
Keywords:
Parameterized Complexity, Kernelization, Total Vertex Cover, Total Edge Cover, Polynomial Kernels, Kernel Lower Bounds
Copyright Message:
Copyright Springer-Verlag Berlin Heidelberg 2010. This work is subject to copyright. All rights are reserved, whether the whole or part of the material is
concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965,
in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law.

Published in the Proceedings of COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Lecture Notes in Computer Science, Volume 6196. The original publication is available at www.springerlink.com : http://www.springerlink.com/content/u772m067xu8167ph/
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Algorithms and Complexity Group
Audience:
experts only
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{FernauFominPhilipSaurabh2010,
AUTHOR = {Fernau, Henning and Fomin, Fedor V. and Philip, Geevarghese and Saurabh, Saket},
EDITOR = {Thai, My T. and Sahni, Sartaj},
TITLE = {The Curse of Connectivity: $t$-Total Vertex (Edge) Cover},
BOOKTITLE = {Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings},
PUBLISHER = {Springer},
YEAR = {2010},
VOLUME = {6196},
PAGES = {34--43},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Nha Trang, Vietnam},
ISBN = {978-3-642-14030-3},
DOI = {10.1007/978-3-642-14031-0},
}


Entry last modified by Geevarghese Philip, 07/08/2014
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
04/21/2012 06:03:17 PM
Revision
0.



Editor
Geevarghese Philip



Edit Date
04/21/2012 06:03:17 PM




File Attachment Icon
cocoon088a.pdf