A note on approximation of the vertex cover and feedback vertex set problems - Unified approach

Information Processing Letters

Volumn 59, Issue 2, 1996, Pages 59-63

  Fujito, Toshihiro ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Combinatorial problems; Design of algorithms; Optimization

Indexed keywords

EID: 0347348473     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00094-4     Document Type: Article

References (9)

1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. 33rd Ann. Symp. on Foundations of Computer Science (1992) 14-23.
2. V. Bafna, P. Berman and T. Fujito, Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs, in: J. Staples, P. Eades, N. Katoh and A. Moffat, eds., ISAAC '95 Algorithms and Computation (1995) 142-151.
3. R. Bar-Yehuda and S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, in: Annals of Discrete Mathematics 25 (North-Holland, Amsterdam, 1985) 27-46.
4. 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 Ann. ACM-SIAM Symp. on Discrete Algorithms (1994) 344-354.
5. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations (Plenum Press, New York, 1972) 85-103.
6. B. Monien and R. Schulz, Four approximation algorithms for the feedback vertex set problem, in: Proc. 7th Conf. on Graph Theoretic Concepts of Computer Science (1981) 315-326.
7. B. Monien and E. Speckenmeyer, Ramsey numbers and an approximation algorithm for the vertex cover problem, Acta Inform. 22 (1985) 115-123.
8. R. Motwani, Lecture notes on approximation algorithms, Tech. Rept. STAN-CS-92-1435, Dept. of Computer Science, Stanford University, 1992.
9. C. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.