Yan Chu, Jianxi Fan, Wenjun Liu, Cheng-Kuan Lin. PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs. In Xian-He Sun, Wenyu Qu, Ivan Stojmenovic, Wanlei Zhou, Zhiyang Li, Hua Guo, Geyong Min, Tingting Yang, Yulei Wu, Lei Liu, editors, Algorithms and Architectures for Parallel Processing - 14th International Conference, ICA3PP 2014, Dalian, China, August 24-27, 2014. Proceedings, Part I. Volume 8630 of Lecture Notes in Computer Science, pages 114-126, Springer, 2014. [doi]
@inproceedings{ChuFLL14,
title = {PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs},
author = {Yan Chu and Jianxi Fan and Wenjun Liu and Cheng-Kuan Lin},
year = {2014},
doi = {10.1007/978-3-319-11197-1_9},
url = {http://dx.doi.org/10.1007/978-3-319-11197-1_9},
researchr = {https://researchr.org/publication/ChuFLL14},
cites = {0},
citedby = {0},
pages = {114-126},
booktitle = {Algorithms and Architectures for Parallel Processing - 14th International Conference, ICA3PP 2014, Dalian, China, August 24-27, 2014. Proceedings, Part I},
editor = {Xian-He Sun and Wenyu Qu and Ivan Stojmenovic and Wanlei Zhou and Zhiyang Li and Hua Guo and Geyong Min and Tingting Yang and Yulei Wu and Lei Liu},
volume = {8630},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-11196-4},
}