%0 Conference Paper %1 conf/isaac/ChenK00 %A Chen, Jianer %A Kanj, Iyad A. %B ISAAC %D 2000 %E Lee, D. T. %E Teng, Shang-Hua %I Springer %K dblp %P 132-143 %T On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. %U http://dblp.uni-trier.de/db/conf/isaac/isaac2000.html#ChenK00 %V 1969 %@ 3-540-41255-7

@inproceedings{conf/isaac/ChenK00, added-at = {2017-05-19T00:00:00.000+0200}, author = {Chen, Jianer and Kanj, Iyad A.}, biburl = {https://www.bibsonomy.org/bibtex/2fea72d28d1d19e8f4a63afc84ff5018b/dblp}, booktitle = {ISAAC}, crossref = {conf/isaac/2000}, editor = {Lee, D. T. and Teng, Shang-Hua}, ee = {https://doi.org/10.1007/3-540-40996-3_12}, interhash = {b58ad86d0056785909706e83eb472ac6}, intrahash = {fea72d28d1d19e8f4a63afc84ff5018b}, isbn = {3-540-41255-7}, keywords = {dblp}, pages = {132-143}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T12:58:02.000+0200}, title = {On Approximating Minimum Vertex Cover for Graphs with Perfect Matching.}, url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2000.html#ChenK00}, volume = 1969, year = 2000 }