Jianer Chen, Iyad A. Kanj. On approximating minimum vertex cover for graphs with perfect matching. Theoretical Computer Science, 337(1-3):305-318, 2005. [doi]
@article{ChenK05:19,
title = {On approximating minimum vertex cover for graphs with perfect matching},
author = {Jianer Chen and Iyad A. Kanj},
year = {2005},
doi = {10.1016/j.tcs.2004.12.034},
url = {http://dx.doi.org/10.1016/j.tcs.2004.12.034},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ChenK05%3A19},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {337},
number = {1-3},
pages = {305-318},
}