Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.
Sally DongYu GaoGramoz GoranciYin Tat LeeRichard PengSushant SachdevaGuanghao YePublished in: SODA (2022)
Keyphrases
- min cost
- max flow
- network flow
- combinatorial optimization problems
- parallel processors
- integer programming
- single processor
- energy minimization
- approximation algorithms
- computer vision
- knapsack problem
- combinatorial optimization
- heuristic search
- optimization problems
- worst case
- resource allocation problems
- evolutionary algorithm