On Approximating Minimum Vertex Cover for Graphs with Perfect Matching

Jianer Chen, Iyad A. Kanj. On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. In D. T. Lee, Shang-Hua Teng, editors, Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Volume 1969 of Lecture Notes in Computer Science, pages 132-143, Springer, 2000. [doi]

Authors

Jianer Chen

This author has not been identified. Look up 'Jianer Chen' in Google

Iyad A. Kanj

This author has not been identified. Look up 'Iyad A. Kanj' in Google