A unified approximation algorithm for node-deletion problems

Discrete Applied Mathematics

Volumn 86, Issue 2-3, 1998, Pages 213-231

  Fujito, Toshihiro ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Hereditary graph property; Local ratio theorem; Node deletion problem; Performance ratio

Indexed keywords

EID: 0013239032     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00035-3     Document Type: Article

References (21)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. 33rd Ann. Symp. on Foundations of Computer Science, 1992, pp. 14-23.
2. V. Bafna, P. Berman, T. Fujito, Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs, in: Proc. ISAAC '95, Lecture Notes in Computer Science, vol. 1004, Springer, Berlin, 1995, pp. 142-151.
3. R. Bar-Yehuda, S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, in: Annals of Discrete Mathematics, vol. 25, North-Holland, Amsterdam, 1985, pp. 27-46.
4. R. Bar-Yehuda, D. Geiger, J. Naor, 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, 1994, pp. 344-354.
5. A. Becker, D. Geiger, Approximation algorithms for the loop cutset problem, in: Proc. 10th Conf. on Uncertainty in AI, Morgan Kaufman, Los Altos, CA, 1994, pp. 60-68.
6. V. Chvátal, A greedy heuristic for the set-covering problem, Mathematics of Oper. Res. 4 (1979) 233-235.
7. G. Even, J. Naor, B. Schieber, M. Sudan, Approximating minimum feedback sets and multi-cuts in directed graphs, in: Proc. IPCO '95, Lecture Notes in Computer Science, vol. 920, Springer, Berlin, 1995, pp. 14-28.
8. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
9. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
10. F. Gavril, cited in Ref. [8].
11. J. Håstad, Some optimal in-approximabitity results, in: Proc. 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 1-10.
12. D.S. Hochbaum, Approximation algorithms for the set covering and vertex cover problems, SIAM J. Comput. 11 (1982) 555-556.
13. D.S. Hochbaum, On the fractional solution to the set covering problem, SIAM J. Algebraic and Discrete Meth. 4 (1983) 221-222.
14. M.S. Krishnamoorthy, N. Deo, Node-deletion NP-complete problems, SIAM J. Comput 8 (1979) 619-625.
15. J.M. Lewis, M. Yannakakis, The Node-deletion problem for hereditary properties is NP-complete, J. Comput. System Sci. 20 (1980) 219-230.
16. C. Lund, M. Yannakakis, The approximation of maximum subgraph problems, in: Proc. 20th ICALP, Lecture Notes in Computer Science, vol. 700, Springer, Berlin, 1993, pp. 40-51.
17. B. Monien, E. Speckenmeyer, Ramsey numbers and an approximation algorithm for the vertex cover problem, Acta Inform. 22 (1985) 115-123.
18. C. Papadimitriou, M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
19. P.D. Seymour, Packing directed circuits fractionally, Combinatorica 15 (1995) 281-288.
20. D.J.A. Welsh, Matroid Theory, Academic Press, London, 1976.
21. M. Yannakakis, Some open problems in approximation, in: Proc. CIAC '94, Lecture Notes in Computer Science, vol. 778, Springer, Berlin, 1994, pp. 33-39.