# Single-Source Dilation-Bounded Minimum Spanning Trees

@article{Cheong2013SingleSourceDM,
title={Single-Source Dilation-Bounded Minimum Spanning Trees},
author={Otfried Cheong and Changryeol Lee},
journal={Int. J. Comput. Geom. Appl.},
year={2013},
volume={23},
pages={159-170}
}
• Published 28 June 2012
• Mathematics
• Int. J. Comput. Geom. Appl.
Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and straight edges. We consider a broadcasting situation, where one point r ∊ S is a designated source. Given a dilation factor δ, we ask for a geometric network G such that for every point v ∊ S there is a path from r to v in G of length at most δ|rv|, and such that the total edge length is minimized. We show that finding such a network of minimum total edge length is NP-hard, and give an…
1 Citations

## Figures from this paper

OPTIMAL PIPELINE CONNECTION FOR THE WATER SUPPLY SYSTEM IN THE KWAHU SOUTH DISTRICT OF GHANA
A Thesis submitted to the Department of Mathematics in Partial fulfilment of the requirements for the award of Degree of Master of Science in Industrial Mathematics. 2013

## References

SHOWING 1-8 OF 8 REFERENCES
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners
• Mathematics
SWAT
• 2000
A O(n log n)-time algorithm is shown which, given a set V of n points in d-dimensional space, and any constant t>1, produces a t-spanner of the complete Euclidean graph of G.
On Spanners of Geometric Graphs
• Mathematics, Computer Science
Int. J. Found. Comput. Sci.
• 2006
It is proved that for every t with $1 < t < \frac{1}{4} \log n$, there exists a connected geometric graph G with n vertices, such that every t-spanner of G contains Ω( n1+1/t ) edges, which almost matches the known upper bound.
Approximating k-hop minimum-spanning trees
• Computer Science
Oper. Res. Lett.
• 2005
Constructing minimal spanning/Steiner trees with bounded path length
• Computer Science
Proceedings ED&TC European Design and Test Conference
• 1996
This paper presents an exact algorithm and two heuristics for solving the Bounded path length Minimal Spanning Tree (BMST) problem, which has polynomial space complexity and is hence more practical than the method presented by Gabow.
Geometric spanner networks
• Computer Science
• 2007
This paper presents a model for designing approximation algorithms with spanners based on the algebraic computation-tree model and some examples show how this model can be applied to well-separated pair decomposition.
Computers and intractability, volume 174
• 1979