A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow.
Jan Van den BrandLi ChenRichard PengRasmus KyngYang P. LiuMaximilian Probst GutenbergSushant SachdevaAaron SidfordPublished in: FOCS (2023)
Keyphrases
- minimum cost flow
- dynamic programming
- computational complexity
- worst case
- network simplex algorithm
- optimal solution
- computational efficiency
- cost function
- search space
- k means
- evolutionary algorithm
- strongly polynomial
- np hard
- mathematical model
- special case
- shortest path
- combinatorial optimization
- data clustering
- graph structure
- shortest path problem