Sign in
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.
Sally Dong
Yu Gao
Gramoz Goranci
Yin Tat Lee
Richard Peng
Sushant Sachdeva
Guanghao Ye
Published in:
CoRR (2022)
Keyphrases
</>
min cost
max flow
network flow
combinatorial optimization problems
parallel processors
single processor
approximation algorithms
worst case
convex programming
energy minimization
optimization problems
integer programming
lagrangian relaxation