{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article12274","name":"Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles","abstract":"In this work we derandomize two central results in graph algorithms, replacement paths and distance sensitivity oracles (DSOs) matching in both cases the running time of the randomized algorithms.\r\nFor the replacement paths problem, let G = (V,E) be a directed unweighted graph with n vertices and m edges and let P be a shortest path from s to t in G. The replacement paths problem is to find for every edge e in P the shortest path from s to t avoiding e. Roditty and Zwick [ICALP 2005] obtained a randomized algorithm with running time of O~(m sqrt{n}). Here we provide the first deterministic algorithm for this problem, with the same O~(m sqrt{n}) time. Due to matching conditional lower bounds of Williams et al. [FOCS 2010], our deterministic combinatorial algorithm for the replacement paths problem is optimal up to polylogarithmic factors (unless the long standing bound of O~(mn) for the combinatorial boolean matrix multiplication can be improved). This also implies a deterministic algorithm for the second simple shortest path problem in O~(m sqrt{n}) time, and a deterministic algorithm for the k-simple shortest paths problem in O~(k m sqrt{n}) time (for any integer constant k > 0).\r\nFor the problem of distance sensitivity oracles, let G = (V,E) be a directed graph with real-edge weights. An f-Sensitivity Distance Oracle (f-DSO) gets as input the graph G=(V,E) and a parameter f, preprocesses it into a data-structure, such that given a query (s,t,F) with s,t in V and F subseteq E cup V, |F| <=f being a set of at most f edges or vertices (failures), the query algorithm efficiently computes the distance from s to t in the graph G \\ F (i.e., the distance from s to t in the graph G after removing from it the failing edges and vertices F).\r\nFor weighted graphs with real edge weights, Weimann and Yuster [FOCS 2010] presented several randomized f-DSOs. In particular, they presented a combinatorial f-DSO with O~(mn^{4-alpha}) preprocessing time and subquadratic O~(n^{2-2(1-alpha)\/f}) query time, giving a tradeoff between preprocessing and query time for every value of 0 < alpha < 1. We derandomize this result and present a combinatorial deterministic f-DSO with the same asymptotic preprocessing and query time.","keywords":["replacement paths","distance sensitivity oracles","derandomization"],"author":[{"@type":"Person","name":"Alon, Noga","givenName":"Noga","familyName":"Alon","email":"mailto:nogaa@tau.ac.il","affiliation":"Department of Mathematics, Princeton University, Princeton, NJ 08544, USA","funding":"Research supported in part by NSF grant DMS-1855464, ISF grant 281\/17 and GIF grant G-1347-304.6\/2016."},{"@type":"Person","name":"Chechik, Shiri","givenName":"Shiri","familyName":"Chechik","email":"mailto:shiri.chechik@gmail.com","affiliation":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","funding":"Research supported in part by the Israel Science Foundation grant No. 1528\/15 and the Blavatnik Fund."},{"@type":"Person","name":"Cohen, Sarel","givenName":"Sarel","familyName":"Cohen","email":"mailto:sarelcoh@post.tau.ac.il","affiliation":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","funding":"Research supported in part by the Israel Science Foundation grant No. 1528\/15 and the Blavatnik Fund."}],"position":12,"pageStart":"12:1","pageEnd":"12:14","dateCreated":"2019-07-04","datePublished":"2019-07-04","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Alon, Noga","givenName":"Noga","familyName":"Alon","email":"mailto:nogaa@tau.ac.il","affiliation":"Department of Mathematics, Princeton University, Princeton, NJ 08544, USA","funding":"Research supported in part by NSF grant DMS-1855464, ISF grant 281\/17 and GIF grant G-1347-304.6\/2016."},{"@type":"Person","name":"Chechik, Shiri","givenName":"Shiri","familyName":"Chechik","email":"mailto:shiri.chechik@gmail.com","affiliation":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","funding":"Research supported in part by the Israel Science Foundation grant No. 1528\/15 and the Blavatnik Fund."},{"@type":"Person","name":"Cohen, Sarel","givenName":"Sarel","familyName":"Cohen","email":"mailto:sarelcoh@post.tau.ac.il","affiliation":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","funding":"Research supported in part by the Israel Science Foundation grant No. 1528\/15 and the Blavatnik Fund."}],"copyrightYear":"2019","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.12","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/arxiv.org\/abs\/1905.07483","http:\/\/dx.doi.org\/10.1145\/2395116.2395121","http:\/\/dx.doi.org\/10.1145\/2858788.2688513","http:\/\/dl.acm.org\/citation.cfm?id=1873601.1873662","http:\/\/dl.acm.org\/citation.cfm?id=1347082.1347087","http:\/\/dx.doi.org\/10.1145\/1536414.1536431","http:\/\/dl.acm.org\/citation.cfm?id=3039686.3039782","http:\/\/dx.doi.org\/10.1007\/s00453-011-9543-0","http:\/\/dl.acm.org\/citation.cfm?id=545381.545490","http:\/\/dx.doi.org\/10.1137\/S0097539705429847","http:\/\/dl.acm.org\/citation.cfm?id=1496770.1496826","http:\/\/dx.doi.org\/10.1145\/1824777.1824784","http:\/\/dx.doi.org\/10.1137\/S0097539795290477","http:\/\/dx.doi.org\/10.1016\/j.ipl.2008.12.015","http:\/\/dx.doi.org\/10.1109\/FOCS.2012.17","http:\/\/dx.doi.org\/10.1109\/IPDPS.2017.56","http:\/\/dx.doi.org\/10.4230\/LIPIcs.STACS.2010.2481","http:\/\/dx.doi.org\/10.1109\/SFFCS.1999.814580","http:\/\/dx.doi.org\/10.1145\/1721837.1721846","http:\/\/dx.doi.org\/10.1287\/mnsc.18.7.401","http:\/\/dx.doi.org\/10.1137\/120897146","http:\/\/dx.doi.org\/10.1016\/0167-6377(89)90065-5","http:\/\/dx.doi.org\/10.1016\/S0020-0190(00)00175-7","http:\/\/dx.doi.org\/10.1007\/11523468_21","http:\/\/dx.doi.org\/10.1109\/FOCS.2010.68","http:\/\/dx.doi.org\/10.1137\/1.9781611973082.102","http:\/\/dx.doi.org\/10.1109\/FOCS.2010.67","http:\/\/dx.doi.org\/10.1287\/mnsc.17.11.712"],"isPartOf":{"@type":"PublicationVolume","@id":"#volume6335","volumeNumber":132,"name":"46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)","dateCreated":"2019-07-04","datePublished":"2019-07-04","editor":[{"@type":"Person","name":"Baier, Christel","givenName":"Christel","familyName":"Baier","email":"mailto:christel.baier@tu-dresden.de","affiliation":"TU Dresden, Germany"},{"@type":"Person","name":"Chatzigiannakis, Ioannis","givenName":"Ioannis","familyName":"Chatzigiannakis","email":"mailto:ichatz@diag.uniroma1.it","affiliation":"Sapienza University of Rome, Italy"},{"@type":"Person","name":"Flocchini, Paola","givenName":"Paola","familyName":"Flocchini","email":"mailto:paola.flocchini@uottawa.ca","affiliation":"University of Ottawa, Canada"},{"@type":"Person","name":"Leonardi, Stefano","givenName":"Stefano","familyName":"Leonardi","email":"mailto:leonardi@diag.uniroma1.it","affiliation":"Sapienza University of Rome, Italy"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article12274","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6335"}}}