Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1004, Issue , 1995, Pages 142-151

  Bafna, Vineet ^a   Berman, Piotr ^b   Fujito, Toshihiro ^c  

^a Center for Discrete Mathematics and Theoretical Computer Science   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c HIROSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

BOUNDED DEGREE; CONSTANT RATIO; LOCAL RATIO; MAXIMUM DEGREE; PERFORMANCE GUARANTEES; UNDIRECTED GRAPH; WEIGHTED FEEDBACK VERTEX SETS;

GRAPH THEORY;

EID: 84955602886     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0015417     Document Type: Conference Paper

References (15)

1. [1] S. Arora, C. Lund, R. Motwani, and M. Sudan and M Szegedy. Proof verification and intractability of approximation problems. In 33rd IEEE Syrup. on Foundations of Computer Science, 1992.
2. [2] Bax-Yehuda, R. and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. In Annals of Discrete Mathematics 25. North-Holland, 1985.
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 Syrup. on Discrete Algorithms, pages 344-354, 1994.
4. [4] A. Becket and D. Geiger. Approximation algorithms for the loop cutset problem. In Uncertainit9 in Artificial Intelligence, 9, 1994.
5. [5] P. Berman. [personal communication]
6. [6] M. R. Garey and D. S. Johnson. COMPUTERS AND INTRACTABILITY: A Guide to the Theory of NP-Completeness. W. H. Freeman and co., 1979.
7. [7] M.M. Halldórsson. Approximations via partitioning. Technical report, Japan Advanced Inst. of Sci. and Tech., March 1995.
8. [8] D.S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6:243-254, 1983.
9. [9] R.M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
10. [10] L. Lovász and M.D. Plummet. Matching Theory. North-Holland, 1986.
11. [11] J.M. Lewis and M. Yannakakis. The Node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20:219-230, 1980.
12. [12] C. Lund and M. Yannakakis. The approximation of maximum subgraph problems. In Proc. of 20th International Colloquium on Automata, Languages and Programming, pages 40-51, 1993.
13. [13] B. Monien and R. Schulz. Four approximation algorithms for the feedback vertex set problem. In Proc. of the 7th Conference on Graph Theoretic Concepts of Computer Science, pages 315-326, 1981.
14. [14] B. Monien and E. Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Informatica, 22:115-123, 1985.
15. [15] C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.