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.
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi. Minmax Tree Cover in the Euclidean Space. J. Graph Algorithms Appl., 15(3):345-371, 2011. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Minmax Tree Cover in the Euclidean SpaceSeigo Karakawa, Ehab Morsy, Hiroshi Nagamochi. walcom 2009: 202-213 [doi] Approximating the minmax rooted-tree cover in a treeHiroshi Nagamochi, Kohei Okada. ipl, 104(5):173-178, 2007. [doi]
The following publications are possibly variants of this publication: