Abstract
Let (V,δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V,δ) has a doubling dimension d and assume that each point p∈V has a disk of radius r(p) around it. The disk graph that corresponds to V and r(⋅) is a directed graph I(V,E,r), whose vertices are the points of V and whose edge set includes a directed edge from p to q if δ(p,q)≤r(p). In Peleg and Roditty (Proc. 7th Int. Conf. on Ad-Hoc Networks and Wireless (AdHoc-NOW), pp. 622–633, 2008) we presented an algorithm for constructing a (1+ϵ)-spanner of size O(nϵ −dlogM), where M is the maximal radius r(p). The current paper presents two results. The first shows that the spanner of Peleg and Roditty (in Proc. 7th Int. Conf. on Ad-Hoc Networks and Wireless (AdHoc-NOW), pp. 622–633, 2008) is essentially optimal, i.e., for metrics of constant doubling dimension it is not possible to guarantee a spanner whose size is independent of M. The second result shows that by slightly relaxing the requirements and allowing a small augmentation of the radius assignment, considerably better spanners can be constructed. In particular, we show that if it is allowed to use edges of the disk graph I(V,E,r 1+ϵ ), where r 1+ϵ (p)=(1+ϵ)⋅r(p) for every p∈V, then it is possible to get a (1+ϵ)-spanner of size O(n/ϵ d) for I(V,E,r). Our algorithm is simple and can be implemented efficiently.
Similar content being viewed by others
References
Baswana, S., Sen, S.: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30(4), 532–563 (2007)
Bollobás, B., Coppersmith, D., Elkin, M.: Sparse distance preservers and additive spanners. SIAM J. Discrete Math. 19(4), 1029–1055 (2005)
Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM J. Comput. 29(5), 1740–1759 (2000)
Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanners for routing in mobile networks. IEEE J. Sel. Areas Commun. 23(1), 174–185 (2005)
Gao, J., Guibas, L., Nguyen, A.: Deformable spanners and applications. Comput. Geom. 35, 2–19 (2006)
Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35, 1148–1184 (2006)
Li, X.Y., Calinescu, G., Wan, P.J., Wang, Y.: Localized Delaunay triangulation with application in ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst. 14(10), 1035–1047 (2003)
Peleg, D., Roditty, L.: Localized spanner construction for ad hoc networks with variable transmission range. In: Proc. 7th Int. Conf. on Ad-Hoc Networks and Wireless (AdHoc-NOW), pp. 622–633 (2008)
Roditty, L.: Fully dynamic geometric spanners. In: 23rd Annual Symposium on Computational Geometry (SoCG), pp. 373–380 (2007)
Wagner, C., Cowen, L.: Compact roundtrip routing for digraphs. In: SODA ’99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pp. 885–886. Society for Industrial and Applied Mathematics, Philadelphia (1999)
Wang, Y., Li, X.Y.: Efficient Delaunay-based localized routing for wireless sensor networks. Int. J. Commun. Syst. 20(7), 767–789 (2006)
Yao, A.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721–736 (1982)
Zwick, L., Roditty, U., Thorup, M.: Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms 4(3), 1–17 (2008)
Author information
Authors and Affiliations
Corresponding author
Additional information
D. Peleg was supported in part by grants from the Minerva Foundation and the Israel Ministry of Science.
Rights and permissions
About this article
Cite this article
Peleg, D., Roditty, L. Relaxed Spanners for Directed Disk Graphs. Algorithmica 65, 146–158 (2013). https://doi.org/10.1007/s00453-011-9580-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-011-9580-8