Approximating maximum independent sets by excluding subgraphs

  title={Approximating maximum independent sets by excluding subgraphs},
  author={R. Boppana and M. Halld{\'o}rsson},
  journal={BIT Numerical Mathematics},
An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known toO(n/(logn)2). We also obtain the same performance guarantee for graph coloring. The results can be combined into a surprisingly strongsimultaneous performance guarantee for the clique and coloring problems.The framework ofsubgraph-excluding algorithms is presented. We survey the known approximation algorithms for the independent set (clique), coloring, and vertex cover… Expand
Polynomial Approximation and Graph-Coloring
  • V. Paschos
  • Mathematics, Computer Science
  • Computing
  • 2003
This paper surveys the main polynomial time approximation algorithms for the minimum graph-coloring and discusses their approximation performance and their complexity, and improves the approximation ratio for graph- Coloring. Expand
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
Two approximation algorithms for the coloring problem and the maximum independent set problem in 3-uniform hypergraphs are discussed and results are obtained through semidefinite programming relaxations of these optimization problems. Expand
Approximating Maximum Clique by Removing Subgraphs
  • U. Feige
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 2004
We show an algorithm that finds cliques of size (log n/log log n)2 whenever a graph has a clique of size at least n/(log n)b for an arbitrary constant b. This leads to an algorithm that approximatesExpand
Approximating Maximum Independent Set in k-Clique-Free Graphs
Lower bounds and approximation algorithms for the independence number α(G) in k-clique-free graphs G are studied and it is shown that there exists an absolute constant c 1 such that for any k-Clique- free graph G on n vertices and with average degree ¯d, α (G) ≥ c 1 log((log ¯d)/k)/d n. Expand
Parallel and On-line Graph Coloring Algorithms
A randomized on-line coloring algorithm with a performance guarantee of O(n/log n), an improvement of √log n factor is presented and a parallel coloring algorithm is constructed with the same performance guarantee, for the first such result. Expand
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set
By a careful analysis on the structure of the intermediate graphs manipulated by the greedy heuristic, it is proved that the performance ratio is improved to (Δ + 3)/3.25. Expand
Hard Graphs for Randomized Subgraph Exclusion Algorithms
A class of graphs on which the performance ratio of the randomized version of the Boppana Halldorsson algorithm is not better than Ω(√n) with probability greater than 1-1/nω(1) is presented. Expand
Ultimate greedy approximation of independent sets in subcubic graphs
The main contribution is a new mathematical theory for the design of such greedy algorithms with efficiently computable advice and for the analysis of their approximation ratios, which achieves the ultimate approximation ratio of 5/4 for greedy on graphs with maximum degree 3. Expand
Packing Cycles and Cuts in Undirected Graphs
It is shown that both Cut Packing and Cycle Packing are NP-hard for planar graphs and new or improved polynomial-time algorithms for Cut Packed for special classes of graphs are derived. Expand
A New Heuristic Algorithm to Solve the Maximum Independent Set Problem
The Maximum Independent Set Problem is a classic graph optimization NPhard problem. Given a graph G=(V,E), the independent set problem is that of finding a maximum-cardinality subset S of V such thatExpand


Improving the performance guarantee for approximate graph coloring
This paper presents an efficient algorithm with performance guarantee of O(n(loglog n)2/(logn)2) for graphs on n vertices. Expand
Graph products and chromatic numbers
  • N. Linial, U. Vazirani
  • Mathematics, Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
Evidence is provided that it is inherently impossible to achieve a better than n/sup epsilon / ratio in polynomial time by showing that 'breaking the n/Sup epsilus / barrier' will automatically lead to vastly better polynometric-time approximation algorithms that achieve ratios closer to log n. Expand
On the Complexity of Approximating the Independent Set Problem
We show that for some positive constant c it is not feasible to approximate Independent Set (for graphs of n nodes) within a factor of n c , provided Maximum 2-Satisfiability does not have aExpand
A still better performance guarantee for approximate graph coloring
Abstract We present an approximation algorithm for graph coloring which achieves a performance guarantee of O(n( log log n) 2 ( log n) 3 ) , a factor of log log n improvement.
Approximating clique is almost NP-complete
The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist,Expand
Determining the Stability Number of a Graph
  • V. Chvátal
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1977
The resulting system is powerful enough to encompass the algorithms of Tarjan''s type and provide very short proofs on graphs for which the stability number equals the clique-covering number. Expand
A note on the independence number of triangle-free graphs
  • J. Shearer
  • Computer Science, Mathematics
  • Discret. Math.
  • 1983
This note gives a simple proof that @a >= n (d ln d - d + 1)/(d - 1)^2 and considers what happens when G contains a limited number of triangles. Expand
An O(n0.4)-approximation algorithm for 3-coloring
  • A. Blum
  • Mathematics, Computer Science
  • STOC '89
  • 1989
A polynomial-time algorithm to color any 3-colorable n-node graph with O(n) colors improves the best previously known bound of O (√n/√log) by reducing the number of colors needed to color a 3- colorable graph. Expand
A Note on Ramsey Numbers
Upper bounds are found for the Ramsey function and it is proved that R(3, x) cx 2 ln x and, for each k ⩾ 3, R(k,x) c k x k − 1 ( lN x) k − 2 asymptotically in x . Expand
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand