Small hop-diameter sparse spanners for doubling metrics

18Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Given a metric M=(V,d), a graph G=(V,E) is a t-spanner for M if every pair of nodes in V has a "short" path (i.e., of length at most t times their actual distance) between them in the spanner. Furthermore, this spanner has a hop diameter bounded by D if every pair of nodes has such a short path that also uses at most D edges. We consider the problem of constructing sparse (1+ε)-spanners with small hop diameter for metrics of low doubling dimension. In this paper, we show that given any metric with constant doubling dimension k and any 0

Cite

CITATION STYLE

APA

Chan, T. H. H., & Gupta, A. (2009). Small hop-diameter sparse spanners for doubling metrics. Discrete and Computational Geometry, 41(1), 28–44. https://doi.org/10.1007/s00454-008-9115-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free