Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs

We study the problem of routing symmetric demand pairs in planar digraphs. The input consists of a directed planar graph $G=(V,E)$ and a collection of $k$ source-destination pairs $\mathcal{M} = \{...