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. [S. Arora, P. Raghavan, S. Rao, Approximation schemes for Euclidean k-medians and related problems, in: STOC'98: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, USA, 1998, pp. 106-113] techniques for the Euclidean k-median problem.

[1]  Sanjeev Arora,et al.  Nearly linear time approximation schemes for Euclidean TSP and other geometric problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[2]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[3]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM.

[4]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[5]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[6]  Jiawei Zhang.  Approximating the two-level facility location problem via a quasi-greedy approach , 2004, SODA '04.

[7]  Satish Rao,et al.  Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.

[8]  David Peleg,et al.  Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems , 2006, CIAC.

[9]  Satish Rao,et al.  A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem , 2007, SIAM J. Comput..

[10]  Ernst Althaus,et al.  Approximating k-hop minimum-spanning trees , 2005, Oper. Res. Lett..

[11]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[12]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[13]  Andrea E. F. Clementi,et al.  Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances , 2005, SIROCCO.

[14]  Mohammad Mahdian,et al.  Improved Approximation Algorithms for Metric Facility Location Problems , 2002, APPROX.

[15]  Karen Aardal,et al.  A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem , 1999, Inf. Process. Lett..

[16]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[17]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[18]  Satish Rao,et al.  A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem , 1999, ESA.

[19]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.