Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time.
Aaron BernsteinMaximilian Probst GutenbergThatchaphol SaranurakPublished in: FOCS (2021)
Keyphrases
- min cost
- max flow
- network flow
- combinatorial optimization problems
- parallel processors
- approximation algorithms
- worst case
- single processor
- minimum cost
- convex programming
- resource allocation problems
- computational complexity
- optimization model
- combinatorial optimization
- phase unwrapping
- linear programming
- optimization problems