Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time.
Aaron BernsteinMaximilian Probst GutenbergThatchaphol SaranurakPublished in: CoRR (2021)
Keyphrases
- min cost
- max flow
- network flow
- combinatorial optimization problems
- parallel processors
- single processor
- energy minimization
- knapsack problem
- ant colony optimization
- integer programming
- approximation algorithms
- genetic algorithm
- combinatorial optimization
- linear programming
- special case
- minimum cost
- lagrangian relaxation
- worst case
- search algorithm