A note on the k-minimum spanning tree problem on circles

摘要

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. (C) 2016 Elsevier B.V. All rights reserved.