Approximating k-hop Minimum Spanning Trees in Euclidean Metrics

In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are interested in computing a rooted spanning tree of minimum cost such that the longest root-leaf path in the tree has at most k edges. We present a polynomial-time approximation scheme for the plane. Our algorithm is based on Arora’s et al. [5] technique for the Euclidean k-median problem.

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Sören Laue, Domagoj Matijevic
• Keywords: CCCG 2007, Computational Geometry, K-hop Spanning Tree, Positive Small Integer, Spanning Tree