Min-Cost Flow in Unit-Capacity Planar Graphs.

Adam Karczmarz Piotr Sankowski

Published in: ESA (2019)

Keyphrases

min cost
planar graphs
max flow
network flow
combinatorial optimization problems
parallel processors
approximation algorithms
energy minimization
lower bound
knapsack problem
undirected graph
belief propagation
lagrangian relaxation
ant colony optimization
graph cuts
higher order
upper bound