External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs

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]

Authors

Yan Chu

This author has not been identified. Look up 'Yan Chu' in Google

Jianxi Fan

This author has not been identified. Look up 'Jianxi Fan' in Google

Wenjun Liu

This author has not been identified. Look up 'Wenjun Liu' in Google

Cheng-Kuan Lin

This author has not been identified. Look up 'Cheng-Kuan Lin' in Google
runs on