Small Hop-diameter Sparse Spanners for Doubling Metrics |
| |
Authors: | T-H Hubert Chan Anupam Gupta |
| |
Institution: | (1) Max-Planck-Institut für Informatik, Saarbrücken, 66123, Germany;(2) Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA |
| |
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<ε<1, one can find (1+ε)-spanner for the metric with nearly linear number of edges (i.e., only O(nlog *
n+n
ε
−O(k)) edges) and constant hop diameter; we can also obtain a (1+ε)-spanner with linear number of edges (i.e., only n
ε
−O(k) edges) that achieves a hop diameter that grows like the functional inverse of Ackermann’s function. Moreover, we prove that
such tradeoffs between the number of edges and the hop diameter are asymptotically optimal.
The conference version of the paper appeared in ACM-SIAM SODA 2006.
This research of T.-H.H. Chan was done while the author was at Carnegie Mellon University and was partly supported by the
NSF grant CCR-0122581 (the ALADDIN project), the NSF CAREER award CCF-0448095, and by an Alfred P. Sloan Fellowship.
This research of A. Gupta was partly supported by the NSF grant CCR-0122581 (the ALADDIN project), the NSF CAREER award CCF-0448095,
and by an Alfred P. Sloan Fellowship. |
| |
Keywords: | Algorithms Sparse spanners Doubling metrics Hop diameter |
本文献已被 SpringerLink 等数据库收录! |
|