Approximating the independence number via theϑ-function

This publication has 12 references indexed in Scilit:

• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  Journal of the ACM, 1995
• A still better performance guarantee for approximate graph coloring
  Information Processing Letters, 1993
• Approximating maximum independent sets by excluding subgraphs
  BIT Numerical Mathematics, 1992
• On the complexity of approximating the independent set problem
  Information and Computation, 1992
• A note on euclidean Ramsey theory and a construction of Bourgain
  Acta Mathematica Hungarica, 1991
• A better performance guarantee for approximate graph coloring
  Algorithmica, 1990
• Forbidden intersections
  Transactions of the American Mathematical Society, 1987
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• On the Shannon capacity of a graph
  IEEE Transactions on Information Theory, 1979
• Some remarks on chromatic graphs
  Colloquium Mathematicum, 1967