Author:
Imamura Tomokazu,Iwama Kazuo,Tsukiji Tatsuie
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)
2. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–45 (1985)
3. Lecture Notes in Computer Science;P. Berman,1995
4. Chen, J., Kanj, I.: On approximating minimum vertex cover for graphs with perfect matching. In: International Symposium on Algorithms and Computation, pp. 132–143 (2000)
5. Clementi, A.E.F., Trevisan, L.: Improved non-approximability results for minimum vertex cover with density constraints. TCS: Theoretical Computer Science 225(1-2), 113–128 (1999)