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

01/18/2021
by   Aaron Bernstein, et al.
0

In the decremental single-source shortest paths problem, the goal is to maintain distances from a fixed source s to every vertex v in an m-edge graph undergoing edge deletions. In this paper, we conclude a long line of research on this problem by showing a near-optimal deterministic data structure that maintains (1+ϵ)-approximate distance estimates and runs in m^1+o(1) total update time. Our result, in particular, removes the oblivious adversary assumption required by the previous breakthrough result by Henzinger et al. [FOCS'14], which leads to our second result: the first almost-linear time algorithm for (1-ϵ)-approximate min-cost flow in undirected graphs where capacities and costs can be taken over edges and vertices. Previously, algorithms for max flow with vertex capacities, or min-cost flow with any capacities required super-linear time. Our result essentially completes the picture for approximate flow in undirected graphs. The key technique of the first result is a novel framework that allows us to treat low-diameter graphs like expanders. This allows us to harness expander properties while bypassing shortcomings of expander decomposition, which almost all previous expander-based algorithms needed to deal with. For the second result, we break the notorious flow-decomposition barrier from the multiplicative-weight-update framework using randomization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2020

Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition

In the decremental single-source shortest paths (SSSP) problem, the inpu...
research
04/09/2020

Near-Optimal Decremental SSSP in Dense Weighted Digraphs

In the decremental Single-Source Shortest Path problem (SSSP), we are gi...
research
07/14/2023

A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs

We describe a simple deterministic near-linear time approximation scheme...
research
11/22/2017

On Computing Min-Degree Elimination Orderings

We study faster algorithms for producing the minimum degree ordering use...
research
06/10/2021

Deterministic Mincut in Almost-Linear Time

We present a deterministic (global) mincut algorithm for weighted, undir...
research
03/01/2022

Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time

In this paper, we introduce a robust notion of (1+ϵ)-approximate (s, t)-...
research
05/03/2022

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time

We present a nearly-linear time algorithm for finding a minimum-cost flo...

Please sign up or login with your details

Forgot password? Click here to reset