A unified local ratio approximation of node-deletion problems: (Extended Abstract)

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

Volumn 1136, Issue , 1996, Pages 167-178

  Fujito, Toshihiro ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

APPROXIMATION METHODS; APPROXIMATION-PRESERVING REDUCTIONS; EXTENDED ABSTRACTS; HEREDITARY GRAPH PROPERTIES; HEREDITARY PROPERTY; PERFORMANCE RATIO; VERTEX COVER PROBLEMS; WEIGHTING SCHEME;

APPROXIMATION ALGORITHMS;

EID: 21444455977     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_54     Document Type: Conference Paper

References (15)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In 33rd Annual Symposium on Foundations of Computer Science, pages 14-23, 1992.
2. V. Bafna, P. Berman, and T. Fujito. Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In ISAAC '95 Algorithms and Computation, volume 1004 of Lecture Notes in Computer Science, pages 142-151, 1995.
3. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. In Annals of Discrete Mathematics, volume 25, pages 27-46. North-Holland, 1985.
4. A. Becket and D. Geiger. Approximation algorithms for the loop outset problem. In Proc. of the 10th conference on Uncertainty in Artificial Intelligence, pages 60-68. Morgan Kaufman, July 1994.
5. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233-235, 1979.
6. F. Gavril. cited in [GJ79], page 134.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and co., San Francisco, 1979.
8. D.S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing, 11(3):555-556, August 1982.
9. D.S. Hochbaum. On the fractional solution to the set covering problem. SIAM J. Alg. Disc. Meth., 4(2):221-222, June 1983.
10. 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.
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. 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. B. Monien and E. Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Informatica, 22:115-123, 1985.
14. C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
15. D.J.A. Welsh. Matroid Theory. Academic Press, New York, 1976