APPROXIMATING MAXIMUM INDEPENDENT SETS BY EXCLUDING SUBGRAPHS

An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to O(n/(log n)2). We also obtain the same performance guarantee for graph coloring. The results can be combined into a surprisingly strong simultaneous performance guarantee for the clique and coloring problems. The framework of subgraph-excluding algorithms is presented. We survey the known approximation algorithms for the independent set (clique), coloring, and vertex cover problems and show how almost all fit into that framework. We show that among subgraph-excluding algorithms, the ones presented achieve the optimal asymptotic performance guarantees.