Approximating k-hop minimum-spanning trees

Authors:
Ernst Althaus;Stefan Funke;Sariel Har-Peled;Jochen KöNemann;Edgar A. Ramos;Martin Skutella
Affiliations:
Université Henri Poincaré, LORIA, B.P. 239, F-54506 Vandoeuvre-lès-Nancy, France;Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany;University of Illinois at Urbana-Champaign, USA;Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West, Waterloo, Canada ON N2L 3G1;University of Illinois at Urbana-Champaign, USA;Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany
Venue:
Operations Research Letters
Year:
2005

Citing 14
Cited 13

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
On approximating arbitrary metrices by tree metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Bicriteria network design problems

Journal of Algorithms
Greedy strikes back: improved facility location algorithms

Journal of Algorithms
Approximating the weight of shallow Steiner trees

Discrete Applied Mathematics
A 3-approximation algorithm for the k-level uncapacitated facility location problem

Information Processing Letters
Generalized submodular cover problems and applications

Theoretical Computer Science
Improved Approximation Algorithms for Metric Facility Location Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
A tight bound on approximating arbitrary metrics by tree metrics

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
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
Minimum spanning tree with hop restrictions

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms

Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Heuristic algorithms for real-time data aggregation in wireless sensor networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
On the bounded-hop MST problem on random Euclidean instances

Theoretical Computer Science
Approximating k-hop minimum spanning trees in Euclidean metrics

Information Processing Letters
Greedy heuristics for the bounded diameter minimum spanning tree problem

Journal of Experimental Algorithmics (JEA)
Delay-constraint topology control in wireless sensor networks format

Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems

Journal of Discrete Algorithms
Topology control for delay-constraint data collection in wireless sensor networks

Computer Communications
Narrow-Shallow-Low-Light Trees with and without Steiner Points

SIAM Journal on Discrete Mathematics
Approximate hierarchical facility location and applications to the shallow steiner tree and range assignment problems

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
Low-Overhead, high-speed multi-core barrier synchronization

HiPEAC'10 Proceedings of the 5th international conference on High Performance Embedded Architectures and Compilers
Fair solutions for some multiagent optimization problems

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a complete graph on~n nodes with metric edge costs, the minimum-costk-hop spanning tree (kHMST) problem asks for a spanning tree of minimum total cost such that the longest root-leaf-path in the tree has at most k edges. We present an algorithm that computes such a tree of total expected cost O(logn) times that of a minimum-cost k-hop spanning-tree.