Greed is good: Approximating independent sets in sparse and bounded-degree graphs

This publication has 17 references indexed in Scilit:

• On syntactic versus computational views of approximability
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Derandomized graph products
  computational complexity, 1995
• On approximation properties of the Independent set problem for degree 3 graphs
  Published by Springer Nature ,1995
• Small transversals in hypergraphs
  Combinatorica, 1992
• Locality in Distributed Graph Algorithms
  SIAM Journal on Computing, 1992
• Parallel Symmetry-Breaking in Sparse Graphs
  SIAM Journal on Discrete Mathematics, 1988
• Efficient bounds for the stable set, vertex cover and set packing problems
  Discrete Applied Mathematics, 1983
• Lower bounds on the independence number in terms of the degrees
  Journal of Combinatorial Theory, Series B, 1983
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
  SIAM Journal on Computing, 1973
• On colouring the nodes of a network
  Mathematical Proceedings of the Cambridge Philosophical Society, 1941