Abstract
Ravi et al. [2] provide a polynomial-time exact solution to the problem of finding a minimum-cost spanning tree with k vertices on the boundary of a convex region and a faster algorithm for the special case of all vertices lying on a circle. In this paper we show that the latter algorithm generally does not solve the kMST problem on circles. A new algorithm is presented that solves the problem in a slightly more general way and with a better complexity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
