New incremental (1+ε)-approximate APSP data structures for sparse digraphs reach O~(m^{3/2}n^{3/4}) deterministic and O~(m^{4/3}n^{5/6}) randomized total update time against adaptive adversaries, plus a near-linear offline SSSP algorithm.
Popular conjectures imply strong lower bounds for dynamic problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
On Incremental Approximate Shortest Paths in Directed Graphs
New incremental (1+ε)-approximate APSP data structures for sparse digraphs reach O~(m^{3/2}n^{3/4}) deterministic and O~(m^{4/3}n^{5/6}) randomized total update time against adaptive adversaries, plus a near-linear offline SSSP algorithm.