MPI-INF D1 Publications: Proceedings Article: On Parameterized Independent Feedback Vertex Set

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Show entries of:

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

Action:

Options:

Library locked

Goto entry point

Author, Editor

Author(s):

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

dblp
dblp
dblp
dblp

Not MPG Author(s):

Misra, Neeldhara
Raman, Venkatesh
Saurabh, Saket

Editor(s):

Fu, Bin
Du, Ding-Zhu

dblp
dblp

Not MPII Editor(s):

Fu, Bin
Du, Ding-Zhu

BibTeX cite key*:

MisraPhilipRamanSaurabh2011

Title, Booktitle

Title*:	On Parameterized Independent Feedback Vertex Set
Attachment(s):	ifvs.pdf (308.17 KB)
Booktitle*:	Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings

Event, URLs

URL of the conference:	http://theory.utdallas.edu/COCOON11/
URL for downloading the paper:	http://www.springerlink.com/content/g12770up6472m606/fulltext.pdf
Event Address*:	Dallas, USA	Language:	English
Event Date* (no longer used):		Organization:
Event Start Date:	14 August 2011	Event End Date:	16 August 2011

Publisher

Name*:	Springer	URL:	http://www.springer.com
Address*:	Berlin	Type:

Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:	6842	Number:
Month:		Pages:	98-109
Year*:	2011	VG Wort Pages:
ISBN/ISSN:	978-3-642-22684-7	Sequence Number:
DOI:	10.1007/978-3-642-22685-4


(LaTeX) Abstract:	We investigate a generalization of the classical \textsc{Feedback Vertex Set} (FVS) problem from the point of view of parameterized algorithms. \textsc{Independent Feedback Vertex Set} (IFVS) is the ``independent'' variant of the FVS problem and is defined as follows: given a graph \(G\) and an integer \(k\), decide whether there exists \(F\subseteq V(G)\), \(\|F\| \leq k\), such that \(G[V(G) \setminus F]\) is a forest and \(G[F]\) is an independent set; the parameter is \(k\). Note that the similarly parameterized versions of the FVS problem --- where there is no restriction on the graph \(G[F]\) --- and its connected variant CFVS --- where \(G[F]\) is required to be connected --- have been extensively studied in the literature. The FVS problem easily reduces to the IFVS problem in a manner that preserves the solution size, and so any algorithmic result for IFVS directly carries over to FVS. We show that IFVS can be solved in time \(O(5^kn^{O(1)})\) time where \(n\) is the number of vertices in the input graph \(G\), and obtain a cubic (\(O(k^{3})\)) kernel for the problem. Note the contrast with the CFVS problem, which does not admit a polynomial kernel unless \(CoNP \subseteq NP/Poly\).
URL for the Abstract:	http://www.springerlink.com/content/g12770up6472m606/
Keywords:	Parameterized Algorithms, Kernelization, Independent Feedback Vertex Set
Copyright Message:	Copyright Springer Berlin 2011. This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, speciﬁcally the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microﬁlms 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 2011, Dallas, USA, August 14-16, 2011. Lecture Notes in Computer Science, Volume 6842. The original publication is available at www.springerlink.com : http://www.springerlink.com/content/g12770up6472m606/

Download Access Level:	Public

Correlation

MPG Unit:	Max-Planck-Institut für Informatik

MPG Subunit:	Algorithms and Complexity Group
Appearance:	MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:

@INPROCEEDINGS{MisraPhilipRamanSaurabh2011,
AUTHOR = {Misra, Neeldhara and Philip, Geevarghese and Raman, Venkatesh and Saurabh, Saket},
EDITOR = {Fu, Bin and Du, Ding-Zhu},
TITLE = {On Parameterized Independent Feedback Vertex Set},
BOOKTITLE = {Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
PUBLISHER = {Springer},
YEAR = {2011},
VOLUME = {6842},
PAGES = {98--109},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Dallas, USA},
ISBN = {978-3-642-22684-7},
DOI = {10.1007/978-3-642-22685-4},
}

Entry last modified by Stephanie Müller, 07/08/2014

Edit History (please click the blue arrow to see the details)

	Editor(s) [Library]	Created 04/22/2012 03:24:58 PM
Revisions 2. 1. 0.	Editor(s) Stephanie Müller Geevarghese Philip Geevarghese Philip	Edit Dates 01.07.2014 14:58:59 12/08/2012 04:42:59 AM 04/22/2012 03:24:58 PM

Attachment Section

Attachment Section

View attachments here:

ifvs.pdf

ifvs.pdf