Planar Embedding of Okamura-Seymour Quasimetrics in Polynomial Time with an Application to Distributed SSSP

Abstract

A quasi-metric $(T,\hat{I}{´}_T)$ is an Okamura-Seymour quasimetric if there exists an edge-weighted planar embedded directed graph $G=(V,E,w)$ such that $T$ is a set of terminals on the outerface of $G$ and $\hat{I}{´}_G(t,t^{\prime })=\hat{I}{´}_T(t,t^{\prime })$ for every pair $(t,t^{\prime })\in T\times T$. If $(T,\hat{I}{´}_T)$ is an Okamura-Seymour quasimetric, then $G$ is a planar embedding of $(T,\hat{I}{´}_T)$. In a recent pioneering work, Chen and Tan gave a polynomial-time algorithm to test if a given quasi-metric $(T,\hat{I}{´}_T)$ is an Okamura-Seymour quasimetric. A key step in their proof is existential, which suffices for an efficient testing algorithm but does not imply an efficient embedding algorithm. Our paper closes this gap by giving an algorithmic implementation of their existential step via linear programming. As a result, we obtain the first polynomial-time algorithm for finding a planar embedding of any given Okamura-Seymour quasimetric $(T,\hat{I}{´}_T)$. As an application, we show how to use our planar embedding of Okamura-Seymour quasimetrics to compute a $(1+\hat{I}\mu )$-approximate single-source shortest path (SSSP) in planar directed graphs in the distributed CONGEST model in $\tilde{O}(D)$ rounds for any fixed $\hat{I}\mu \in (0,1)$, nearly matching a simple lower bound of $\hat{I}\text{c◯}(D)$ and resolving a fundamental problem in this area. The best-known algorithm for this problem has round complexity $\tilde{O}(D^2)$.