2015/05/14 by Lee-Ad Gottlieb, Gottlieb, Lee-Ad · 1 citation
Computer Science · #Computational Geometry and Mesh Generation #Advanced Graph Theory Research #Complexity and Algorithms in Graphs
paper · pdf · doi:10.48550/arxiv.1505.03681
It has long been known that d-dimensional Euclidean point sets admit (1+ε)-stretch spanners with lightness WE = ε-O(d), that is total edge weight at most WE times the weight of the minimum spaning tree of the set [DHN93]. Whether or not a similar result holds for metric spaces with low doubling dimension has remained an important open problem, and has resisted numerous attempts at resolution. In this paper, we resolve the question in the affirmative, and show that doubling spaces admit (1+ε)-stretch spanners with lightness WD = (ddim/ε)O(ddim). Important in its own right, our result also implies a much faster polynomial-time approximation scheme for the traveling salesman problemin doubling metric spaces, improving upon the bound presented in [BGK-12].