1 Search Results for "Pandit, Vinayaka"

Document

DOI: 10.4230/LIPIcs.FSTTCS.2010.251

Finding Independent Sets in Unions of Perfect Graphs

Authors: Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, and Yogish Sabharwal

Published in: LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)

Abstract

The maximum independent set problem (MaxIS) on general graphs is known to be NP-hard to approximate within a factor of $n^{1-epsilon}$, for any $epsilon > 0$. However, there are many ``easy" classes of graphs on which the problem can be solved in polynomial time. In this context, an interesting question is that of computing the maximum independent set in a graph that can be expressed as the union of a small number of graphs from an easy class. The MaxIS problem has been studied on unions of interval graphs and chordal graphs. We study the MaxIS problem on unions of perfect graphs (which generalize the above two classes). We present an $O(sqrt{n})$-approximation algorithm when the input graph is the union of two perfect graphs. We also show that the MaxIS problem on unions of two comparability graphs (a subclass of perfect graphs) cannot be approximated within any constant factor.

Cite as

Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, and Yogish Sabharwal. Finding Independent Sets in Unions of Perfect Graphs. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 251-259, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{chakaravarthy_et_al:LIPIcs.FSTTCS.2010.251,
  author =	{Chakaravarthy, Venkatesan T. and Pandit, Vinayaka and Roy, Sambuddha and Sabharwal, Yogish},
  title =	{{Finding Independent Sets in Unions of Perfect Graphs}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
  pages =	{251--259},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-23-1},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{8},
  editor =	{Lodaya, Kamal and Mahajan, Meena},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.251},
  URN =		{urn:nbn:de:0030-drops-28683},
  doi =		{10.4230/LIPIcs.FSTTCS.2010.251},
  annote =	{Keywords: Approximation Algorithms; Comparability Graphs; Hardness of approximation}
}

Refine by Author
1 Chakaravarthy, Venkatesan T.
1 Pandit, Vinayaka
1 Roy, Sambuddha
1 Sabharwal, Yogish

Refine by Classification

Refine by Keyword
1 Approximation Algorithms; Comparability Graphs; Hardness of approximation

Refine by Type
1 document

Refine by Publication Year
1 2010

1 Search Results for "Pandit, Vinayaka"

Finding Independent Sets in Unions of Perfect Graphs

Abstract

Cite as

Thanks for your feedback!

Could not send message