Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
A 3-approximation algorithm for the k-level uncapacitated facility location problem
Information Processing Letters
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximating the two-level facility location problem via a quasi-greedy approach
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A Nearly Linear-Time Approximation Scheme for the Euclidean $k$-Median Problem
SIAM Journal on Computing
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Approximating k-hop minimum-spanning trees
Operations Research Letters
| Hi-index | 0.89 |
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.