On approximation properties of the Independent set problem for degree 3 graphs

  • Piotr Berman
  • Toshihiro Fujito
Invited Presentation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 955)


The main problem we consider in this paper is the Independent Set problem for bounded degree graphs. It is shown that the problem remains MAX SNP-complete when the maximum degree is bounded by 3. Some related problems are also shown to be MAX SNP-complete at the lowest possible degree bounds. Next we study better poly-time approximation of the problem for degree 3 graphs, and improve the previously best ratio, 5/4, to arbitrarily close to 6/5. This result also provides improved poly-time approximation ratios, B+3/5+ε, for odd degree B.


Input Graph Polynomial Time Approximation Scheme Good Ratio Bound Degree Graph Minimum Vertex Cover Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. In 33rd IEEE Symp. on Foundations of Computer Science, 1992.Google Scholar
  2. 2.
    B.S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the Association for Computing Machinery, 41:153–180, 1994.Google Scholar
  3. 3.
    R. Bar-Yehuda, D. Geiger, J. Naor and R. M. Roth. Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference. In Proc. of the 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 344–354, 1994.Google Scholar
  4. 4.
    P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs. In Proc. of the 5th Annual ACM-SIAM Symp. on Discrete Algorithms, 1994.Google Scholar
  5. 5.
    R.L. Brooks. On coloring the nodes of a network. In Proc. Cambridge Philos. Soc., volume 37, pages 194–197, 1941.Google Scholar
  6. 6.
    M.R. Garey, D.S. Johnson and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237–267, 1976.CrossRefGoogle Scholar
  7. 7.
    M.M. Halldórsson and J. Radhakrishnan. Greed is good: Approximating independent sets in sparse and bounded-degree graphs. In Proc. of the 26th Annual ACM Symp. on Theory of Computing, 1994.Google Scholar
  8. 8.
    M.M. Halldórsson and J. Radhakrishnan. Improved approximations of independent sets in bounded-degree graphs. In SWAT 94, 6th Scandinavian Workshop on Algorithm Theory, 1994.Google Scholar
  9. 9.
    D.S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6:243–254, 1983.CrossRefGoogle Scholar
  10. 10.
    V. Kann. Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters, 37:27–35, 1991.CrossRefGoogle Scholar
  11. 11.
    S. Khanna, R. Motwani, M. Sudan and U. Vazirani. On syntactic versus computation views of approximability. In 35th IEEE Symp. on Foundations of Computer Science, pages 819–830, 1994.Google Scholar
  12. 12.
    L. Lovász. Three short proofs in graph theory. Journal of Combinatorial Theory (B), 19:269–271, 1975.CrossRefGoogle Scholar
  13. 13.
    G.L. Nemhauser and L.E. Trotter Jr.. Vertex packings: structural properties and algorithms. Mathematical Programming, 8:232–248, 1975.CrossRefGoogle Scholar
  14. 14.
    C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425–440, 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Piotr Berman
    • 1
  • Toshihiro Fujito
    • 2
  1. 1.Dept. of Computer Science and EngineeringThe Pennsylvania State UniversityUniversity ParkUSA
  2. 2.Dept. of Electrical EngineeringHiroshima UniversityHigashi-HiroshimaJapan

Personalised recommendations