Chung-Shou Liao, Louxin Zhang. Approximating the Spanning k-Tree Forest Problem. In Xiaotie Deng, John E. Hopcroft, Jinyun Xue, editors, Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings. Volume 5598 of Lecture Notes in Computer Science, pages 293-301, Springer, 2009. [doi]
@inproceedings{LiaoZ09,
title = {Approximating the Spanning k-Tree Forest Problem},
author = {Chung-Shou Liao and Louxin Zhang},
year = {2009},
doi = {10.1007/978-3-642-02270-8_30},
url = {http://dx.doi.org/10.1007/978-3-642-02270-8_30},
researchr = {https://researchr.org/publication/LiaoZ09},
cites = {0},
citedby = {0},
pages = {293-301},
booktitle = {Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings},
editor = {Xiaotie Deng and John E. Hopcroft and Jinyun Xue},
volume = {5598},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-02269-2},
}