3 citations · 15 across the 10 of their papers we have counts for
1 paper · 2 filters
Haim Kaplan, Yahav Nussbaum
In this paper we study the min-cost flow problem in planar networks. We start with the min-cost flow problem and apply two transformations, one is based on geometric duality of pla…