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]
Abstract is missing.