On approximation properties of the independent set problem for low degree graphs

Theory of Computing Systems

Volumn 32, Issue 2, 1999, Pages 115-132

  Berman, P ^a   Fujito, T ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b HIROSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

APPROXIMATION PROPERTIES; APPROXIMATION RATIOS; DEGREE BOUNDS; INDEPENDENT SET PROBLEMS; LOW DEGREE GRAPHS; PERFORMANCE RATIO; POLYNOMIAL TIME APPROXIMATION; VERTEX COVER PROBLEMS;

GRAPH THEORY;

EID: 0033481566     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000113     Document Type: Article

References (16)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. 33rd Annual Symp. on Foundations of Computer Science, pages 14-23, 1992.
2. B.S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the Association for Computing Machinery, 41:153-180, 1994.
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. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 344-354, 1994.
4. P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs. In Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 365-371, 1994.
5. R.B. Boppana and M.M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32(2): 180-196, 1992.
6. R.L. Brooks. On coloring the nodes of a network. Proceedings of the Cambridge Philosophical Society, 37:194-197, 1941.
7. M.R. Garey, D.S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237-267, 1976.
8. M.M. Halldórsson and J. Radhakrishnan. Improved approximations of independent sets in bounded-degree graphs. Nordic Journal of Computing, 1(4):475-492, 1994.
9. M.M. Halldórsson and J. Radhakrishnan. Greed is good: approximating independent sets in sparse and bounded-degree graphs. Algorithmica, 18:143-163, 1997.
10. M.M. Halldórsson and K. Yoshihara. Greedy approximations of independent sets in low degree graphs. In Proc. 6th Internat. Symp. on Algorithms and Computation (ISAAC), LNCS #1004, Springer-Verlag, Berlin, pages 152-161, 1995.
11. 1-ε. In Proc. 37th Annual Symp. on Foundations of Computer Science, pages 627-636, 1996.
12. D.S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6:243-254, 1983.
13. V. Kann. Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters, 37:27-35, 1991.
14. L. Lovász. Three short proofs in graph theory. Journal of Combinatorial Theory, Series B, 19:269-271, 1975.
15. G.L. Nemhauser and L.E. Trotter, Jr., Vertex packings: structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
16. C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.