  We give an $O(n^{1.5} \log n)$ algorithm that, given a directed planar graph
with arc capacities, a set of source nodes and a single sink node, finds a
maximum flow from the sources to the sink . This is the first subquadratic-time
strongly polynomial algorithm for the problem.
