Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath

dblp
dblp
dblp
dblp
dblp

Not MPG Author(s):

Misra, Neeldhara
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath

Editor(s):

Rahman, Md. Saidur
Fujita, Satoshi

dblp
dblp

Not MPII Editor(s):

Rahman, Md. Saidur
Fujita, Satoshi

BibTeX cite key*:

MisraPhilipRamanSaurabhSikdar2010

Title, Booktitle

Title*:

FPT Algorithms for Connected Feedback Vertex Set


cfvs_walcom.pdf (173.39 KB)

Booktitle*:

WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings

Event, URLs

URL of the conference:

http://www.buet.ac.bd/cse/walcom2010/

URL for downloading the paper:

http://www.springerlink.com/content/b22572825042j8mk/fulltext.pdf

Event Address*:

Dhaka, Bangladesh

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

10 February 2010

Event End Date:

12 February 2010

Publisher

Name*:

Springer

URL:

http://www.springer.com

Address*:

Berlin

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

5942

Number:


Month:


Pages:

269-280

Year*:

2010

VG Wort Pages:


ISBN/ISSN:

978-3-642-11439-7

Sequence Number:


DOI:

10.1007/978-3-642-11440-3_25



Note, Abstract, ©


(LaTeX) Abstract:

We study the recently introduced \textsc{Connected Feedback
Vertex Set (CFVS)} problem from the view-point of parameterized algorithms.
CFVS is the connected variant of the classical
\textsc{Feedback Vertex Set} problem and is defined as follows:
given a graph $G=(V,E)$ and an integer $k$, decide
whether there exists $F\subseteq V$, $|F| \leq k$,
such that $G[V \setminus F]$ is a forest
and $G[F]$ is connected. We show that \textsc{Connected Feedback Vertex
Set} can be solved in time $O(2^{O(k)}n^{O(1)})$ on general graphs
and in time $O(2^{O(\sqrt{k}\log k)}n^{O(1)})$ on graphs excluding
a fixed graph $H$ as a minor. Our result on general undirected graphs
uses, as a subroutine, a parameterized algorithm for \textsc{Group Steiner
Tree}, a well studied variant of \textsc{Steiner Tree}. We find the
algorithm for \textsc{Group Steiner Tree} of independent interest
and believe that it could be useful for obtaining parameterized algorithms
for other connectivity problems.

URL for the Abstract:

http://www.springerlink.com/content/b22572825042j8mk/

Keywords:

Parameterized Algorithms, Connected Feedback Vertex Set, Group Steiner Tree

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 WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Lecture Notes in Computer Science, Volume 5942. The original publication is available at www.springerlink.com : http://www.springerlink.com/content/b22572825042j8mk/


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{MisraPhilipRamanSaurabhSikdar2010,
AUTHOR = {Misra, Neeldhara and Philip, Geevarghese and Raman, Venkatesh and Saurabh, Saket and Sikdar, Somnath},
EDITOR = {Rahman, Md. Saidur and Fujita, Satoshi},
TITLE = {{FPT} Algorithms for Connected Feedback Vertex Set},
BOOKTITLE = {WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings},
PUBLISHER = {Springer},
YEAR = {2010},
VOLUME = {5942},
PAGES = {269--280},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Dhaka, Bangladesh},
ISBN = {978-3-642-11439-7},
DOI = {10.1007/978-3-642-11440-3_25},
}


Entry last modified by Geevarghese Philip, 07/08/2014
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
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 04:51:50 PM
Revision
0.



Editor
Geevarghese Philip



Edit Date
04/21/2012 04:51:50 PM



Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
cfvs_walcom.pdf