Skip to main content
SpringerLink
Log in

Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time

  • Conference paper
Distributed Computing (DISC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4731))

Included in the following conference series:

Abstract

The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n 3/2) edge 3-spanner for it in O(logn) time. This algorithm is then extended into a deterministic algorithm for computing an O(k n 1 + 1/k) edge O(k)-spanner in 2O(k)logk − 1 n time for every integer parameter \(k \geqslant 1\). This establishes that the problem of the deterministic construction of a linear (in k) stretch spanner with few edges can be solved in the distributed setting in polylogarithmic time.

The paper also investigates the distributed construction of sparse spanners with almost pure additive stretch (1 + ε,β), i.e., such that the distance in the spanner is at most 1 + ε times the original distance plus β. It is shown, for every ε> 0, that in O(ε − 1logn) time one can deterministically construct a spanner with O(n 3/2) edges that is both a 3-spanner and a (1 + ε,8logn)-spanner. Furthermore, it is shown that in \(n^{O(1/\sqrt{\log n})} + O(1/\epsilon)\) time one can deterministically construct a spanner with O(n 3/2) edges which is both a 3-spanner and a (1 + ε,4)-spanner. This algorithm can be transformed into a Las Vegas randomized algorithm with guarantees on the stretch and time, running in O(ε − 1 + logn) expected time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Awerbuch, B.: Complexity of network synchronization. J. ACM 32, 804–823 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  2. Awerbuch, B., Berger, B., Cowen, L.J., Peleg, D.: Near-linear cost sequential and distributed constructions of sparse neighborhood coverss. In: 34th IEEE Symp. on Foundations of Computer Science, pp. 638–647. IEEE Computer Society Press, Los Alamitos (1993)

    Google Scholar 

  3. Awerbuch, B., Berger, B., Cowen, L.J., Peleg, D.: Fast distributed network decompositions and covers. J. Parallel and Distributed Computing 39, 105–114 (1996)

    Article  MATH  Google Scholar 

  4. Awerbuch, B., Berger, B., Cowen, L.J., Peleg, D.: Near-linear time construction of sparse neighbourhood covers. SIAM J. on Computing 28, 263–277 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Awerbuch, B., Goldberg, A., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364–369. IEEE Computer Society Press, Los Alamitos (1989)

    Chapter  Google Scholar 

  6. Awerbuch, B., Peleg, D.: Sparse partitions. In: 31th IEEE Symp. on Foundations of Computer Science, pp. 503–513. IEEE Computer Society Press, Los Alamitos (1990)

    Google Scholar 

  7. Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: New constructions of (α,β)-spanners and purely additive spanners. In: 16th ACM-SIAM Symp. on Discrete Algorithms, pp. 672–681. ACM Press, New York (2005)

    Google Scholar 

  8. Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in \(\tilde{O}(n^2)\) time. In: 15th ACM-SIAM Symp. on Discrete Algorithms, pp. 271–280. ACM Press, New York (2004)

    Google Scholar 

  9. Baswana, S., Sen, S.: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Structures and Algorithms 30, 532–563 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  10. Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. on Computing 28, 210–236 (1998)

    Article  MATH  Google Scholar 

  11. Cowen, L.J.: Compact routing with minimum stretch. J. Algorithms 38, 170–183 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  12. Derbel, B., Gavoille, C.: Fast deterministic distributed algorithms for sparse spanners. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 100–114. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Derbel, B., Mosbah, M., Zemmari, A.: Fast distributed graph partition and application. In: 20th IEEE Int. Parallel and Distributed Processing Symp., IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  14. Dor, D., Halperin, S., Zwick, U.: All pairs almost shortest paths. SIAM J. Computing 29, 1740–1759 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Dubhashi, D., Mai, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. of Computer and System Sciences 71, 467–479 (2005)

    Article  MATH  Google Scholar 

  16. Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. J. Algorithms 46, 97–114 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Elkin, M.: Computing almost shortest paths. In: 20th ACM Symp. on Principles of Distributed Computing, pp. 53–62. ACM Press, New York (2001)

    Google Scholar 

  18. Elkin, M., Peleg, D.: (1 + ε,β)-spanner constructions for general graphs. SIAM J. on Computing 33, 608–631 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. Elkin, M., Zhang, J.: Efficient algorithms for constructing (1 + ε,β)-spanners in the distributed and streaming models. In: 23rd ACM Symp. on Principles of Distributed Computing, pp. 160–168. ACM Press, New York (2004)

    Google Scholar 

  20. Gavoille, C., Peleg, D., Pérennès, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53, 85–112 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  21. Moran, S., Snir, S.: Simple and efficient network decomposition and synchronization. Theoretical Computer Science 243, 217–241 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  22. Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. J. Algorithms 20, 356–374 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  23. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)

    Google Scholar 

  24. Peleg, D., Ullman, J.D.: An optimal synchornizer for the hypercube. SIAM J. Computing 18, 740–747 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  25. Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM 36, 510–530 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  26. Pettie, S.: Low distortion spanners. In: 34th International Colloquium on Automata, Languages and Programming. LNCS, vol. 4596, Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  27. Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. In: 13th ACM-SIAM Symp. on Discrete Algorithms, pp. 844–851. ACM Press, New York (2002)

    Google Scholar 

  28. Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 261–272. Springer, Heidelberg (2005)

    Google Scholar 

  29. Thorup, M., Zwick, U.: Compact routing schemes. In: 13th ACM Symp. on Parallel Algorithms and Architectures, pp. 1–10. ACM Press, New York (2001)

    Google Scholar 

  30. Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52, 1–24 (2005)

    Article  MathSciNet  Google Scholar 

  31. Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: 17th ACM-SIAM Symp. on Discrete Algorithm, pp. 802–809. ACM Press, New York (2006)

    Chapter  Google Scholar 

  32. Wenger, R.: Extremal graphs with no C 4’s, C 6’s, or C 10’s. J. Combinatorial Theory, Series B 52, 113–116 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale (LIF), Université de Provence Aix-Marseille 1, France

    Bilel Derbel

  2. Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux, France

    Cyril Gavoille

  3. Department of Computer Science and Applied Mathematics, The Weizmann Institute, Rehovot, Israel

    David Peleg

Authors
  1. Bilel Derbel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cyril Gavoille
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Peleg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Pelc

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Derbel, B., Gavoille, C., Peleg, D. (2007). Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75142-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75141-0

  • Online ISBN: 978-3-540-75142-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation