Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2755573.2755574acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
research-article

Improved Parallel Algorithms for Spanners and Hopsets

Published: 13 June 2015 Publication History

Abstract

We use exponential start time clustering to design faster parallel graph algorithms involving distances. Previous algorithms usually rely on graph decomposition routines with strict restrictions on the diameters of the decomposed pieces. We weaken these bounds in favor of stronger local probabilistic guarantees. This allows more direct analyses of the overall process, giving:
Linear work parallel algorithms that construct spanners with O(k) stretch and size O(n1+1/k) in unweighted graphs, and size O(n1+1/k log k) in weighted graphs.
Hopsets that lead to the first parallel algorithm for approximating shortest paths in undirected graphs with O(m poly log n) work.

References

[1]
Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete Comput. Geom., 9(1):81--100, January 1993.
[2]
N. Alon, R. Karp, D. Peleg, and D. West. A graph-theoretic game and its application to the k-server problem. SIAM J. Comput., 24(1):78--100, 1995.
[3]
Baruch Awerbuch. Complexity of network synchronization. J. Assoc. Comput. Mach., 32(4):804--823, 1985.
[4]
Yair Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on, pages 184--193. IEEE, 1996.
[5]
Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, and Kanat Tangwongsan. Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. Theory Comput. Syst., 55(3):521--554, 2014.
[6]
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie. New constructions of (α,β)-spanners and purely additive spanners. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '05, pages 672--681, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
[7]
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie. Additive spanners and (α, β)-spanners. ACM Transactions on Algorithms (TALG), 7(1):5, 2010.
[8]
Surender Baswana and Sandeep Sen. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms, 30(4):532--563, July 2007.
[9]
Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, and Shen Chen Xu. Stretching stretch. CoRR, abs/1401.2454, 2014.
[10]
Edith Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput., 28(1):210--236, 1998.
[11]
Edith Cohen. Polylog-time and near-linear work approximation scheme for undirected shortest paths. J. ACM, 47(1):132--166, 2000.
[12]
Dorit Dor, Shay Halperin, and Uri Zwick. All-pairs almost shortest paths. SIAM J. Comput., 29(5):1740--1759, March 2000.
[13]
Joseph Gil, Yossi Matias, and Uzi Vishkin. Towards a theory of nearly constant time parallel algorithms. In FOCS, pages 698--710. IEEE Computer Society, 1991.
[14]
Ioannis Koutis. Simple parallel and distributed algorithms for spectral graph sparsification. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, pages 61--66, New York, NY, USA, 2014. ACM.
[15]
Philip N Klein and Sairam Subramanian. A randomized parallel algorithm for single-source shortest paths. Journal of Algorithms, 25(2):205--220, 1997.
[16]
Howard Karloff, Siddharth Suri, and Sergei Vassilvitskii. A model of computation for mapreduce. In Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '10, pages 938--948, Philadelphia, PA, USA, 2010. Society for Industrial and Applied Mathematics.
[17]
Gary L. Miller, Richard Peng, Adrian Vladu, and Shen Chen Xu. Improved parallel algorithms for spanners and hopsets. CoRR, abs/1309.3545, 2014.
[18]
Gary L. Miller, Richard Peng, and Shen Chen Xu. Parallel graph decompositions using random shifts. In Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures, SPAA '13, pages 196--203, New York, NY, USA, 2013. ACM.
[19]
David Peleg. Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
[20]
Seth Pettie. Distributed algorithms for ultrasparse spanners and linear size skeletons. In Proceedings of the Twenty-seventh ACM Symposium on Principles of Distributed Computing, PODC '08, pages 253--262, New York, NY, USA, 2008. ACM.
[21]
David Peleg and Alejandro A. Schäffer. Graph spanners. Journal of Graph Theory, 13(1):99--116, 1989.
[22]
Liam Roditty, Mikkel Thorup, and Uri Zwick. Deterministic constructions of approximate distance oracles and spanners. In Proceedings of the 32nd International Conference on Automata, Languages and Programming, ICALP'05, pages 261--272, Berlin, Heidelberg, 2005. Springer-Verlag.
[23]
Julian Shun, Laxman Dhulipala, and Guy Blelloch. A simple and practical linear-work parallel algorithm for connectivity. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, pages 143--153, New York, NY, USA, 2014. ACM.
[24]
Hanmao Shi and Thomas H. Spencer. Time-work tradeoffs of the single-source shortest paths problem. J. Algorithms, 30(1):19--32, January 1999.
[25]
Mikkel Thorup and Uri Zwick. Approximate distance oracles. J. ACM, 52(1):1--24, Jan 2005.
[26]
J. Ullman and M. Yannakakis. High-probability parallel transitive-closure algorithms. SIAM Journal on Computing, 20(1):100--125, 1991.

Cited By

View all
  • (2023)Scalable algorithms for compact spanners on real world graphsProceedings of the 37th International Conference on Supercomputing10.1145/3577193.3593727(386-397)Online publication date: 21-Jun-2023
  • (2023)A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest PathsProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585196(1159-1172)Online publication date: 2-Jun-2023
  • (2023)Faster Edge‐Path Bundling through Graph SpannersComputer Graphics Forum10.1111/cgf.1478942:6Online publication date: 3-Apr-2023
  • Show More Cited By

Index Terms

  1. Improved Parallel Algorithms for Spanners and Hopsets

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures
    June 2015
    362 pages
    ISBN:9781450335881
    DOI:10.1145/2755573
    • General Chair:
    • Guy Blelloch,
    • Program Chair:
    • Kunal Agrawal
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 13 June 2015

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. approximation algorithms
    2. graph algorithms
    3. parallel algorithms
    4. shortest path problem

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    SPAA '15

    Acceptance Rates

    SPAA '15 Paper Acceptance Rate 31 of 131 submissions, 24%;
    Overall Acceptance Rate 447 of 1,461 submissions, 31%

    Upcoming Conference

    SPAA '25
    37th ACM Symposium on Parallelism in Algorithms and Architectures
    July 28 - August 1, 2025
    Portland , OR , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)24
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 18 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Scalable algorithms for compact spanners on real world graphsProceedings of the 37th International Conference on Supercomputing10.1145/3577193.3593727(386-397)Online publication date: 21-Jun-2023
    • (2023)A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest PathsProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585196(1159-1172)Online publication date: 2-Jun-2023
    • (2023)Faster Edge‐Path Bundling through Graph SpannersComputer Graphics Forum10.1111/cgf.1478942:6Online publication date: 3-Apr-2023
    • (2023)Time-optimal construction of overlay networksDistributed Computing10.1007/s00446-023-00442-436:3(313-347)Online publication date: 15-Feb-2023
    • (2022)Constant-Round Near-Optimal Spanners in Congested CliqueProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538439(325-334)Online publication date: 20-Jul-2022
    • (2022)Parallel Shortest Paths with Negative Edge WeightsProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538583(177-190)Online publication date: 11-Jul-2022
    • (2022)Distributed strong diameter network decompositionTheoretical Computer Science10.1016/j.tcs.2022.04.019922(150-157)Online publication date: Jun-2022
    • (2022)Constructing light spanners deterministically in near-linear timeTheoretical Computer Science10.1016/j.tcs.2022.01.021Online publication date: Jan-2022
    • (2022)Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNCDistributed Computing10.1007/s00446-022-00431-z35:5(419-437)Online publication date: 29-Jun-2022
    • (2021)GraphMineSuiteProceedings of the VLDB Endowment10.14778/3476249.347625214:11(1922-1935)Online publication date: 1-Jul-2021
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media