Abstract
Given a metric (V,d), a spanner is a sparse graph whose shortest-path metric approximates the distance d to within a small multiplicative distortion. In this paper, we study the problem of spanners with slack: e.g., can we find sparse spanners where we are allowed to incur an arbitrarily large distortion on a small constant fraction of the distances, but are then required to incur only a constant (independent of n) distortion on the remaining distances? We answer this question in the affirmative, thus complementing similar recent results on embeddings with slack into ℓ p spaces. For instance, we show that if we ignore an ε fraction of the distances, we can get spanners with O(n) edges and \(O(\log {\frac{1}{\epsilon}})\) distortion for the remaining distances.
We also show how to obtain sparse and low-weight spanners with slack from existing constructions of conventional spanners, and these techniques allow us to also obtain the best known results for distance oracles and distance labelings with slack. This paper complements similar results obtained in recent research on slack embeddings into normed metric spaces.
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213. This research was partly supported by the NSF CAREER award CCF-0448095, and by an Alfred P. Sloan Fellowship.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abraham, I., Bartal, Y., Neiman, O.: Advances in metric embedding theory. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (2006)
Abraham, I., Bartal, Y., Chan, H.T.-H., Dhamdhere, K., Gupta, A., Kleinberg, J.M., Neiman, O., Slivkins, A.: Metric embeddings with relaxed guarantees. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 83–100. IEEE Computer Society, Washington (2005)
Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9(1) (1993)
Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.H.M.: Euclidean spanners: short, thin, and lanky. In: STOC (1995)
Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (1996)
Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: New constructions of (α, β)-spanners and purely additive spanners. In: SODA, pp. 672–681 (2005)
Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in õ(n2) time. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 271–280 (2004)
Bollobás, B., Coppersmith, D., Elkin, M.: Sparse distance preservers and additive spanners (extended abstract). In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 414–423. ACM, New York (2003)
Bourgain, J.: On Lipschitz embeddings of finite metric spaces in Hilbert space. Israel Journal of Mathematics 52(1-2) (1985)
Chan, H.T.-H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in DOubling metrics. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (2005)
Chandra, B., Das, G., Narasimhan, G., Soares, J.: New sparseness results on graph spanners. Internat. J. Comput. Geom. Appl. 5(1-2) (1995); In: Eighth Annual ACM Symposium on Computational Geometry, Berlin (1992)
Chaudhuri, S., Zaroliagis, C.D.: Shortest paths in digraphs of small treewidth. I. Sequential algorithms. Algorithmica 27(3-4), 212–226 (2000) (Treewidth)
Coppersmith, D., Elkin, M.: Sparse source-wise and pair-wise distance preservers. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (2005)
Elkin, M., Peleg, D.: (1 + ε,β)-spanner constructions for general graphs. SIAM J. Comput (electronic) 33(3), 608–631 (2004)
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the Annual ACM Symposium on Theory of Computing (2003)
Gavoille, C., Peleg, D., Perennes, S., Raz, R.: Distance labeling in graphs. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (2001)
Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M.H.M.: Approximate distance oracles for geometric graphs. In: SODA, pp. 828–837 (2002)
Gupta, A., Kumar, A., Rastogi, R.: Traveling with a Pez dispenser (or, routing issues in MPLS). SIAM J. Comput (electronic) 34(2), 453–474 (2004/2005)
Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics, and their applications. In: Symposium on Computational Geometry, pp. 150–158 (2005)
Indyk, P.: Algorithmic aspects of geometric embeddings. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (2001)
Kleinberg, J.M., Slivkins, A., Wexler, T.: Triangulation and embedding using small sets of beacons. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (2004)
Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665. Springer, Heidelberg (1999)
Peleg, D.: Distributed computing. Society for Industrial and Applied Mathematics (SIAM), A locality-sensitive approach (2000)
Peleg, D., Schäffer, A.A.: Graph spanners. J. Graph Theory 13(1) (1989)
Talwar, K.: Bypassing the embedding: Algorithms for low-dimensional metrics. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (2004)
Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (2001)
Thorup, M., Zwick, U.: Approximate distance oracles. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (2001)
Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: SODA, pp. 802–809 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, T.H.H., Dinitz, M., Gupta, A. (2006). Spanners with Slack. In: Azar, Y., Erlebach, T. (eds) Algorithms – ESA 2006. ESA 2006. Lecture Notes in Computer Science, vol 4168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841036_20
Download citation
DOI: https://doi.org/10.1007/11841036_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38875-3
Online ISBN: 978-3-540-38876-0
eBook Packages: Computer ScienceComputer Science (R0)