Login / Signup
Min-Cost Flow in Unit-Capacity Planar Graphs.
Adam Karczmarz
Piotr Sankowski
Published in:
CoRR (2019)
Keyphrases
</>
min cost
planar graphs
max flow
network flow
combinatorial optimization problems
parallel processors
approximation algorithms
energy minimization
linear programming
weighted graph
lagrangian relaxation
image segmentation
np hard
knapsack problem
integer programming
approximate inference