Take the 2-minute tour ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

We know that Maximum Independent Set (MIS) is hard to approximate within a factor of $n^{1-\epsilon}$ for any $\epsilon > 0$ unless P = NP. What are some special classes of graphs for which better approximation algorithms are known?

What are the graphs for which polynomial-time algorithms are known? I know for perfect graphs this is known, but are there other interesting classes of graphs?

share|improve this question
1  
The exact (non-approximation) version of this question: cstheory.stackexchange.com/q/2503/109 –  András Salamon Nov 13 '12 at 19:54

5 Answers 5

up vote 17 down vote accepted

There is a truly awesome list of all known graph classes that have some nontrivial algorithms for MIS: see this entry in the graph classes website.

share|improve this answer
7  
That list aims exclusively for exact algorithms. On the approximation, the major class might be the PTAS on planar graphs, bounded genus graphs, and H-minor-free graphs. –  Yixin Cao Nov 9 '12 at 18:36
    
Thanks Suresh. The list is quite comprehensive. Thanks also to Yan for the approximation results. –  Arindam Pal Nov 10 '12 at 2:15
2  
the corresponding references are: Brenda S. Baker: Approximation Algorithms for NP-Complete Problems on Planar Graphs. J. ACM 41(1): 153-180 (1994); David Eppstein: Diameter and Treewidth in Minor-Closed Graph Families. Algorithmica 27(3): 275-291 (2000); Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646. See also: courses.csail.mit.edu/6.889/fall11/lectures/L08.html and courses.csail.mit.edu/6.889/fall11/lectures/L09.html –  Christian Sommer Nov 14 '12 at 19:16

I don't have a good overview of this problem, but I can give some examples. A simple approximation algorithm would be to find some order of the nodes and greedily select the nodes to be in the independent set if non of its previous neighbors have been selected in the independent set.

If the graph has degeneracy $d$ then using the degeneracy ordering will give a $d$-approximation. hence for graphs of degeneracy $n^{1-\epsilon}$ we have a good enough approximation.

There is a couple of other techniques for approximations that work too, but I don't know them well. See: http://en.wikipedia.org/wiki/Baker%27s_technique and http://courses.engr.illinois.edu/cs598csc/sp2011/Lectures/lecture_7.pdf

For the polynomial algorithms solving the problems exactly The link Suresh gave is the best. Which graphclasses that are more interesting is hard to say.

One class you wont find in that list is the complement of $k$-degenerate graphs. Since max clique can be solved in $O(2^k n)$ on graphs of degeneracy $k$ see http://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm especially the work of Eppstein. Then Independent set is polynomial on G if the complement of G has degeneracy $O(\log n)$.

share|improve this answer
    
As Mohammad Al-Turkistany said in his answer cubic planar graphs are one of those non perfect graphs where independent set can be approximated. All planar graphs has degeneracy at most 5, and graphs of genus k has degeneracy O(k) and independent set can hence approximated. –  Martin Vatshelle Nov 10 '12 at 5:10

For the class of cubic planar graphs, this paper, An approximation algorithm for the maximum independent set problem in cubic planar graphs by Elarbi Choukhmane and John Franco, gives a polynomial time approximation algorithm. The approximation factor of their algorithm is 6/7.

share|improve this answer
1  
That was already obsolete by Baker's technique (FOCS'83) at the time it was published in 1986 –  David Eppstein Jan 26 at 19:14

I haven't checked the answers above, so my apologies if there is an overlap. Here is a special case where you can solve it exactly in polynomial time. If your graph G is a line graph, then run a polynomial time algorithm to find the root graph H, and then find a maximum matching in H.

share|improve this answer
    
Both line graphs and complement of line graphs are polynomial and covered by the list given by Suresh Venkat. –  Martin Vatshelle Nov 14 '12 at 1:32
    
Thank you Martin. –  Babis Tsourakakis Nov 14 '12 at 22:01

In geometric intersection graphs, there are several interesting approximations, PTASs, and sub-exponential exact algorithms. See the Wikipedia article Maximum Disjoint Set for a survey.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.