The MST of symmetric disk graphs is light
Computational Geometry: Theory and Applications
Low-interference networks in metric spaces of bounded doubling dimension
Information Processing Letters
Optimal euclidean spanners: really short, thin and lanky
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed graph satisfying the weak gap property has O(n) edges and total weight $O( \log n ) \cdot wt({\mathord{\it MST}}(S))$, where $wt({\mathord{\it MST}}(S))$ denotes the weight of a minimum spanning tree of S. We show that 2-optimal TSP tours and greedy spanners satisfy the weak gap property.