Abstract
The starting point of our research is the following problem: given a doubling metric ℳ=(V,d), can one (efficiently) find an unweighted graph G′=(V′,E′) with V⊆V′ whose shortest-path metric d′ is still doubling, and which agrees with d on V×V? While it is simple to show that the answer to the above question is negative if distances must be preserved exactly. However, allowing a (1+ε) distortion between d and d′ enables us bypass this hurdle, and obtain an unweighted graph G′ with doubling dimension at most a factor O(log ε −1) times the doubling dimension of G.
More generally, this paper gives algorithms that construct graphs G′ whose convex (or geodesic) closure has doubling dimension close to that of ℳ, and the shortest-path distances in G′ closely approximate those of ℳ when restricted to V×V. Similar results are shown when the metric ℳ is an additive (tree) metric and the graph G′ is restricted to be a tree.
Similar content being viewed by others
References
Assouad, P.: Plongements Lipschitziens dans R n. Bull. Soc. Math. France 111(4), 429–448 (1983)
Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: The 23rd International Conference on Machine Learning (ICML) (2006)
Călinescu, G., Karloff, H., Rabani, Y.: Approximation algorithms for the 0-extension problem. SIAM J. Comput. 34(2), 358–372 (2004/2005)
Chan, T.-H.H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 762–771 (2005)
Clarkson, K.L.: Nearest neighbor queries in metric spaces. Discrete Comput. Geom. 22(1), 63–93 (1999)
Cole, R., Gottlieb, L.-A.: Searching dynamic point sets in spaces with bounded doubling dimension. In: The Thirty-Eighth Annual ACM Symposium on Theory of Computing (STOC) (2006)
Fakcharoenphol, J., Harrelson, C., Rao, S., Talwar, K.: An improved approximation algorithm for the 0-extension problem. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 257–265. SIAM, Philadelphia (2003)
Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low–distortion embeddings. In: Proceedings of the 44th Symposium on the Foundations of Computer Science (FOCS), pp. 534–543 (2003)
Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35(5), 1148–1184 (2006) (electronic)
Indyk, P., Naor, A.: Nearest-neighbor-preserving embeddings. ACM Trans. Algorithms 3(3), 31 (2007), 12 pp.
Johnson, W.B., Lindenstrauss, J., Schechtman, G.: Extensions of Lipschitz maps into Banach spaces. Isr. J. Math. 54(2), 129–138 (1986)
Karzanov, A.: Minimum 0-extensions of graph metrics. Eur. J. Comb. 19(1), 71–101 (1998)
Konjevod, G., Richa, A.W., Xia, D.: Optimal scale-free compact routing schemes in doubling networks. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2007)
Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 798–807. SIAM, Philadelphia (2004)
Krauthgamer, R., Lee, J.R.: The black-box complexity of nearest-neighbor search. Theor. Comput. Sci. 348(2–3), 262–276 (2005)
Lee, J.R., Naor, A.: Absolute Lipschitz extendability. C. R. Math. Acad. Sci. Paris 338(11), 859–862 (2004)
Lee, J.R., Naor, A., Peres, Y.: Trees and Markov convexity. Geom. Funct. Anal. 18(5), 1609–1659 (2009)
Matoušek, J.: Extension of Lipschitz mappings on metric trees. Comment. Math. Univ. Carol. 31(1), 99–104 (1990)
Semmes, S.: On the nonexistence of bi-Lipschitz parameterizations and geometric problems about A ∞-weights. Rev. Mat. Iberoam. 12(2), 337–410 (1996)
Talwar, K.: Bypassing the embedding: algorithms for low-dimensional metrics. In: Proceedings of the 36th ACM Symposium on the Theory of Computing (STOC), pp. 281–290 (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partly supported by the NSF CAREER award CCF-0448095 and CCF-0729022, and by an Alfred P. Sloan Fellowship.
Rights and permissions
About this article
Cite this article
Gupta, A., Talwar, K. Making Doubling Metrics Geodesic. Algorithmica 59, 66–80 (2011). https://doi.org/10.1007/s00453-010-9397-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-010-9397-x