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]
@inproceedings{ChenK00:6,
title = {On Approximating Minimum Vertex Cover for Graphs with Perfect Matching},
author = {Jianer Chen and Iyad A. Kanj},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/1969/19690132.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ChenK00%3A6},
cites = {0},
citedby = {0},
pages = {132-143},
booktitle = {Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
editor = {D. T. Lee and Shang-Hua Teng},
volume = {1969},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-41255-7},
}