Abstract:In the dynamic Single-Source Shortest Paths (SSSP) problem, we are given a graph G = (V, E) subject to edge insertions and deletions and a source vertex s ∈ V , and the goal is to maintain the distance d(s, t) for all t ∈ V .Fine-grained complexity has provided strong lower bounds for exact partially dynamic SSSP and approximate fully dynamic SSSP [ESA'04, FOCS'14, STOC'15]. Thus much focus has been directed towards finding efficient partially dynamic (1+ ε)-approximate SSSP algorithms [STOC'14, ICALP'15, SODA… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.