Papers
Topics
Authors
Recent
Search
2000 character limit reached

A light metric spanner

Published 14 May 2015 in cs.CG | (1505.03681v1)

Abstract: It has long been known that dd-dimensional Euclidean point sets admit (1+ϵ)(1+\epsilon)-stretch spanners with lightness WE=ϵ<sup>−O(d)W_E = \epsilon<sup>{-O(d)}, that is total edge weight at most WEW_E 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+ϵ)(1+\epsilon)-stretch spanners with lightness WD=(ddim/ϵ)<sup>O(ddim)W_D = (ddim/\epsilon)<sup>{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].

Authors (1)
Citations (43)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.