Hiroshi Nagamochi, Kohei Okada. Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. In Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono, editors, Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings. Volume 2906 of Lecture Notes in Computer Science, pages 138-147, Springer, 2003. [doi]
@inproceedings{NagamochiO03,
title = {Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem},
author = {Hiroshi Nagamochi and Kohei Okada},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2906&spage=138},
researchr = {https://researchr.org/publication/NagamochiO03},
cites = {0},
citedby = {0},
pages = {138-147},
booktitle = {Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
editor = {Toshihide Ibaraki and Naoki Katoh and Hirotaka Ono},
volume = {2906},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-20695-7},
}