{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:53Z","timestamp":1750309313793,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649695","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1141-1152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1224-9730","authenticated-orcid":false,"given":"Xiao","family":"Mao","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Ittai Abraham and Shiri Chechik. 2013. Dynamic Decremental Approximate Distance Oracles with (1+\u220a 2) stretch. 07."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214084"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Shiri Chechik and Sebastian Krinninger. 2017. Fully dynamic all-pairs shortest paths with worst-case update-time revisited. In SODA.","DOI":"10.1137\/1.9781611974782.28"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2014.1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/320176.320178"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Surender Baswana Ramesh Hariharan and Sandeep Sen. 2002. Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. 117\u2013123. https:\/\/doi.org\/10.1145\/509927.509928 10.1145\/509927.509928","DOI":"10.1145\/509927.509928"},{"key":"e_1_3_2_1_7_1","unstructured":"Surender Baswana Ramesh Hariharan and Sandeep Sen. 2003. Maintaining all-pairs approximate shortest paths under deletion of edges. In SODA \u201903."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.16"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/130938670"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00100"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Shiri Chechik. 2018. Near-Optimal Approximate Decremental All Pairs Shortest Paths. 170\u2013181. https:\/\/doi.org\/10.1109\/FOCS.2018.00025 10.1109\/FOCS.2018.00025","DOI":"10.1109\/FOCS.2018.00025"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Shiri Chechik and Tianyi Zhang. [n. d.]. Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. 87\u201399. https:\/\/doi.org\/10.1137\/1.9781611977554.ch4 arxiv:https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611977554.ch4. 10.1137\/1.9781611977554.ch4","DOI":"10.1137\/1.9781611977554.ch4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Chandra Chekuri and Kent Quanrud. 2018. Randomized MWU for Positive LPs. In SODA.","DOI":"10.1137\/1.9781611975031.25"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Julia Chuzhoy. 2021. Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time.","DOI":"10.1145\/3406325.3451025"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Camil Demetrescu and Giuseppe Italiano. 2002. Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. 633\u2013643. isbn:978-3-540-43864-9 https:\/\/doi.org\/10.1007\/3-540-45465-9_54 10.1007\/3-540-45465-9_54","DOI":"10.1007\/3-540-45465-9_54"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780567"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.005"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2021.64"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322235"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.007"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","unstructured":"Maximilian Probst Gutenberg and Christian Wulff-Nilsen. 2020. Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. 2522\u20132541. https:\/\/doi.org\/10.1137\/1.9781611975994.154 arxiv:https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611975994.154. 10.1137\/1.9781611975994.154","DOI":"10.1137\/1.9781611975994.154"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.156"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797327209"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1493"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/140957299"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_30_1","unstructured":"Adam Karczmarz. 2021. Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. In International Colloquium on Automata Languages and Programming."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Adam Karczmarz and Jakub Lacki. [n. d.]. Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. 106\u2013120. https:\/\/doi.org\/10.1137\/1.9781611976014.15 arxiv:https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611976014.15. 10.1137\/1.9781611976014.15","DOI":"10.1137\/1.9781611976014.15"},{"key":"e_1_3_2_1_32_1","unstructured":"Adam Karczmarz and Jakub Lacki. 2019. Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. In ESA."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2023.84"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814580"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","unstructured":"Valerie King and Mikkel Thorup. 2001. A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. 2108 268\u2013277. isbn:978-3-540-42494-9 https:\/\/doi.org\/10.1007\/3-540-44679-6_30 10.1007\/3-540-44679-6_30","DOI":"10.1007\/3-540-44679-6_30"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","unstructured":"P. Klein and S. Subramanian. 1998. A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. Algorithmica 22 (1998) 11 235\u2013249. https:\/\/doi.org\/10.1007\/PL00009223 10.1007\/PL00009223","DOI":"10.1007\/PL00009223"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.22"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Liam Roditty and Uri Zwick. 2004. On Dynamic Shortest Paths Problems. Algorithmica 61 isbn:978-3-540-23025-0 https:\/\/doi.org\/10.1007\/978-3-540-30140-0_52 10.1007\/978-3-540-30140-0_52","DOI":"10.1007\/978-3-540-30140-0_52"},{"key":"e_1_3_2_1_39_1","first-page":"216","article-title":"Transitivit\u00e9 et connexit\u00e9. C. R","author":"Roy Bernard","year":"1959","unstructured":"Bernard Roy. 1959. Transitivit\u00e9 et connexit\u00e9. C. R. Acad. Sci. Paris (in French), 216\u2013218.","journal-title":"Acad. Sci. Paris (in French)"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_33"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060607"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/97444.97686"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00035"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591811"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vancouver BC Canada","acronym":"STOC '24"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649695","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:51Z","timestamp":1750291431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":45,"alternative-id":["10.1145\/3618260.3649695","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649695","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}