skip to main content
10.1145/2897518.2897521acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Deterministic decremental single source shortest paths: beyond the o(mn) bound

Published: 19 June 2016 Publication History

Abstract

In this paper we consider the decremental single-source shortest paths (SSSP) problem, where given a graph G and a source node s the goal is to maintain shortest paths between s and all other nodes in G under a sequence of online adversarial edge deletions.
In their seminal work, Even and Shiloach [JACM 1981] presented an exact solution to the problem with only O(mn) total update time over all edge deletions. Their classic algorithm was the best known result for the decremental SSSP problem for three decades, even when approximate shortest paths are allowed.
The first improvement over the Even-Shiloach algorithm was given by Bernstein and Roditty [SODA 2011], who for the case of an unweighted and undirected graph presented an approximate (1+) algorithm with constant query time and a total update time of O(n2+O(1/√logn)). This work triggered a series of new results, culminating in a recent breakthrough of Henzinger, Krinninger and Nanongkai [FOCS 14], who presented a -approximate algorithm whose total update time is near linear O(m1+ O(1/√logn)). In this paper they posed as a major open problem the question of derandomizing their result.
In fact, all known improvements over the Even-Shiloach algorithm are randomized. All these algorithms maintain some truncated shortest path trees from a small subset of nodes. While in the randomized setting it is possible to “hide” these nodes from the adversary, in the deterministic setting this is impossible: the adversary can delete all edges touching these nodes, thus forcing the algorithm to choose a new set of nodes and incur a new computation of shortest paths.
In this paper we present the first deterministic decremental SSSP algorithm that breaks the Even-Shiloach bound of O(mn) total update time, for unweighted and undirected graphs. Our algorithm is (1 + є) approximate and achieves a total update time of Õ(n2). Our algorithm can also achieve the same bounds in the incremental setting. It is worth mentioning that for dense instances where m = Ω(n2 − 1/√log(n)), our algorithm is also faster than all existing randomized algorithms.

References

[1]
I. Abraham and S. Chechik. Dynamic decremental approximate distance oracles with (1 +, 2) stretch. CoRR, abs/1307.1516, 2013.
[2]
I. Abraham, S. Chechik, and C. Gavoille. Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. In Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing (STOC), pages 1199–1218, 2012.
[3]
I. Abraham, S. Chechik, and K. Talwar. Fully dynamic all-pairs shortest paths: Breaking the o(n) barrier. In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 1–16, 2014.
[4]
G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, and U. Nanni. Incremental algorithms for minimal length paths. J. Algorithms, 12(4):615–638, 1991.
[5]
S. Baswana, R. Hariharan, and S. Sen. Maintaining all-pairs approximate shortest paths under deletion of edges. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 394–403, 2003.
[6]
S. Baswana, R. Hariharan, and S. Sen. Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. Journal of Algorithms, 62(2):74–92, 2007. Announced at STOC’02.
[7]
S. Baswana and T. Kavitha. Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science, FOCS, pages 591–602, 2006.
[8]
S. Baswana, S. Khurana, and S. Sarkar. Fully dynamic randomized algorithms for graph spanners. ACM Transactions on Algorithms, 8(4):35, 2012.
[9]
A. Bernstein. Fully dynamic (2 + epsilon) approximate all-pairs shortest paths with fast query and close to linear update time. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pages 693–702, 2009.
[10]
A. Bernstein. Maintaining shortest paths under deletions in weighted directed graphs: {extended abstract}. In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing (STOC), pages 725–734, 2013.
[11]
A. Bernstein and L. Roditty. Improved dynamic algorithms for maintaining approximate shortest paths under deletions. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1355–1365, 2011.
[12]
S. Chechik. Compact routing schemes with improved stretch. In ACM Symposium on Principles of Distributed Computing, PODC, pages 33–41, 2013.
[13]
S. Chechik. Approximate distance oracles with constant query time. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC), pages 654–663, 2014.
[14]
S. Chechik. Approximate distance oracles with improved bounds. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC), pages 1–10, 2015.
[15]
C. Demetrescu and G. F. Italiano. A new approach to dynamic all pairs shortest paths. J. ACM, 51(6):968–992, 2004.
[16]
C. Demetrescu and G. F. Italiano. Fully dynamic all pairs shortest paths with real edge weights. J. Comput. Syst. Sci., 72(5):813–837, 2006.
[17]
Y. Dinitz. Dinitz’ algorithm: The original version and even’s version. In Theoretical Computer Science, Essays in Memory of Shimon Even, pages 218–240, 2006.
[18]
S. Even and Y. Shiloach. An on-line edge-deletion problem. Journal of the ACM, 28(1):1–4, 1981.
[19]
J. Fakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. Journal of Computer and System Sciences, 72(5):868–889, 2006. Announced at FOCS’01.
[20]
M. Henzinger, S. Krinninger, and D. Nanongkai. Dynamic approximate all-pairs shortest paths: Breaking the o(mn) barrier and derandomization. In Proceedings of the 54th Annual Symposium on Foundations of Computer Science, FOCS, pages 538–547, 2013.
[21]
M. Henzinger, S. Krinninger, and D. Nanongkai. Decremental single-source shortest paths on undirected graphs in near-linear total update time. In Proceedings of the 55th Annual Symposium on Foundations of Computer Science, FOCS, pages 146–155, 2014.
[22]
M. Henzinger, S. Krinninger, and D. Nanongkai. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC), pages 674–683, 2014.
[23]
M. Henzinger, S. Krinninger, and D. Nanongkai. A subquadratic-time algorithm for decremental single-source shortest paths. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1053–1072, 2014.
[24]
M. Henzinger, S. Krinninger, and D. Nanongkai. Improved algorithms for decremental single-source reachability on directed graphs. In Proceedings of the 42nd International Colloquium, ICALP, pages 725–736, 2015.
[25]
M. Henzinger, S. Krinninger, D. Nanongkai, and T. Saranurak. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC), pages 21–30, 2015.
[26]
M. R. Henzinger and V. King. Maintaining minimum spanning forests in dynamic graphs. SIAM J. Comput., 31(2):364–374, 2001.
[27]
M. R. Henzinger, P. N. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3–23, 1997. Announced at STOC’94.
[28]
J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM, 48(4):723–760, 2001.
[29]
V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS, pages 81–91, 1999.
[30]
V. King and M. Thorup. A space saving trick for directed dynamic transitive closure and shortest path algorithms. In COCOON, pages 268–277, 2001.
[31]
P. N. Klein and S. Subramanian. A fully dynamic approximation scheme for shortest paths in planar graphs. Algorithmica, 22(3):235–249, 1998. Announced at WADS’93.
[32]
A. Madry. Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 121–130, 2010.
[33]
D. Peleg and A. A. Schäffer. Graph spanners. Journal of Graph Theory, 13(1):99–116, 1989.
[34]
D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. SIAM J. Comput., 18(4):740–747, 1989.
[35]
D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. J. ACM, 36(3):510–530, 1989.
[36]
S. Pettie and V. Ramachandran. A shortest path algorithm for real-weighted undirected graphs. SIAM J. Comput., 34(6):1398–1431, 2005.
[37]
L. Roditty and U. Zwick. On dynamic shortest paths problems. Algorithmica, 61(2):389–401, 2011.
[38]
L. Roditty and U. Zwick. Dynamic approximate all-pairs shortest paths in undirected graphs. SIAM J. Comput., 41(3):670–683, 2012.
[39]
M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM, 46(3):362–394, 1999.
[40]
M. Thorup. On RAM priority queues. SIAM J. Comput., 30(1):86–109, 2000.
[41]
M. Thorup. Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles. In SWAT, pages 384–396, 2004.
[42]
M. Thorup. Worst-case update times for fully-dynamic all-pairs shortest paths. In Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing (STOC), pages 112–119, 2005.
[43]
M. Thorup and U. Zwick. Compact routing schemes. In SPAA, pages 1–10, 2001.
[44]
M. Thorup and U. Zwick. Approximate distance oracles. J. ACM, 52(1):1–24, 2005.

Cited By

View all
  • (2024)Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00120(2010-2032)Online publication date: 27-Oct-2024
  • (2023)Deterministic Incremental APSP with Polylogarithmic Update Time and StretchProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585213(1173-1186)Online publication date: 2-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
  • Show More Cited By

Index Terms

  1. Deterministic decremental single source shortest paths: beyond the o(mn) bound

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
    June 2016
    1141 pages
    ISBN:9781450341325
    DOI:10.1145/2897518
    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 ACM 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: 19 June 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Approximation Algorithms
    2. Dynamic Algorithms
    3. Shortest Paths

    Qualifiers

    • Research-article

    Conference

    STOC '16
    Sponsor:
    STOC '16: Symposium on Theory of Computing
    June 19 - 21, 2016
    MA, Cambridge, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)14
    • Downloads (Last 6 weeks)3
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00120(2010-2032)Online publication date: 27-Oct-2024
    • (2023)Deterministic Incremental APSP with Polylogarithmic Update Time and StretchProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585213(1173-1186)Online publication date: 2-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)Deterministic Fully Dynamic SSSP and More2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00142(2312-2321)Online publication date: 6-Nov-2023
    • (2022)Faster maxflow via improved dynamic spectral vertex sparsifiersProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520068(543-556)Online publication date: 9-Jun-2022
    • (2022)Dynamic algorithms against an adaptive adversary: generic constructions and lower boundsProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520064(1671-1684)Online publication date: 9-Jun-2022
    • (2022)Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS52979.2021.00100(1000-1008)Online publication date: Feb-2022
    • (2021)Deterministic algorithms for decremental shortest paths via layered core decompositionProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458211(2478-2496)Online publication date: 10-Jan-2021
    • (2021)Incremental single source shortest paths in sparse digraphsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458210(2463-2477)Online publication date: 10-Jan-2021
    • (2021)New techniques and fine-grained hardness for dynamic near-additive spannersProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458174(1836-1855)Online publication date: 10-Jan-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