Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition

09/17/2020
by   Julia Chuzhoy, et al.
0

In the decremental single-source shortest paths (SSSP) problem, the input is an undirected graph G=(V,E) with n vertices and m edges undergoing edge deletions, together with a fixed source vertex s∈ V. The goal is to maintain a data structure that supports shortest-path queries: given a vertex v∈ V, quickly return an (approximate) shortest path from s to v. The decremental all-pairs shortest paths (APSP) problem is defined similarly, but now the shortest-path queries are allowed between any pair of vertices of V. Both problems have been studied extensively since the 80's, and algorithms with near-optimal total update time and query time have been discovered for them. Unfortunately, all these algorithms are randomized and, more importantly, they need to assume an oblivious adversary. Our first result is a deterministic algorithm for the decremental SSSP problem on weighted graphs with O(n^2+o(1)) total update time, that supports (1+ϵ)-approximate shortest-path queries, with query time O(|P|· n^o(1)), where P is the returned path. This is the first (1+ϵ)-approximation algorithm against an adaptive adversary that supports shortest-path queries in time below O(n), that breaks the O(mn) total update time bound of the classical algorithm of Even and Shiloah from 1981. Our second result is a deterministic algorithm for the decremental APSP problem on unweighted graphs that achieves total update time O(n^2.5+δ), for any constant δ>0, supports approximate distance queries in O(loglog n) time; the algorithm achieves an O(1)-multiplicative and n^o(1)-additive approximation on the path length. All previous algorithms for APSP either assume an oblivious adversary or have an Ω(n^3) total update time when m=Ω(n^2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/12/2021

Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time

We study the decremental All-Pairs Shortest Paths (APSP) problem in undi...
research
05/27/2019

A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems

We study the vertex-decremental Single-Source Shortest Paths (SSSP) prob...
research
11/02/2022

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths

We provide new tradeoffs between approximation and running time for the ...
research
09/05/2020

Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing

Let G = (V,E,w) be a weighted, digraph subject to a sequence of adversar...
research
01/29/2020

Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler

In the decremental (1+ϵ)-approximate Single-Source Shortest Path (SSSP) ...
research
07/26/2019

Almost Shortest Paths and PRAM Distance Oracles in Weighted Graphs

Let G=(V,E) be a weighted undirected graph with n vertices and m edges, ...
research
01/18/2021

Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time

In the decremental single-source shortest paths problem, the goal is to ...

Please sign up or login with your details

Forgot password? Click here to reset