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

2026-06-30

AI Summary

This work addresses the problem of constructing a planar embedding for Okamura–Seymour quasi-metrics in polynomial time and applies this technique to achieve a distributed $(1+\varepsilon)$-approximation for single-source shortest paths (SSSP) in directed planar graphs. By devising the first constructive linear programming–based algorithm, it efficiently implements a previously non-constructive step from the work of Chen and Tan. In the CONGEST model, for any fixed $\varepsilon \in (0,1)$, the algorithm reduces the round complexity from $\widetilde{O}(D^2)$ to $\widetilde{O}(D)$, nearly matching the $\Omega(D)$ lower bound. This constitutes a significant breakthrough in distributed graph algorithms, particularly for planar networks.

Abstract

A quasi-metric $(T,δ_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 $δ_G(t,t') = δ_T(t,t')$ for every pair $(t,t')\in T\times T$. If $(T,δ_T)$ is an Okamura-Seymour quasimetric, then $G$ is a planar embedding of $(T,δ_T)$. In a recent pioneering work, Chen and Tan gave a polynomial-time algorithm to test if a given quasi-metric $(T,δ_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,δ_T)$. As an application, we show how to use our planar embedding of Okamura-Seymour quasimetrics to compute a $(1+ε)$-approximate single-source shortest path (SSSP) in planar directed graphs in the distributed CONGEST model in $\widetilde{O}(D)$ rounds for any fixed $ε\in (0,1)$, nearly matching a simple lower bound of $Ω(D)$ and resolving a fundamental problem in this area. The best-known algorithm for this problem has round complexity $\widetilde{O}(D^2)$.

Problem

• planar embedding
• Okamura-Seymour quasimetric
• polynomial time
• single-source shortest path
• distributed CONGEST model

Innovation

• planar embedding
• Okamura-Seymour quasimetric
• polynomial-time algorithm
• distributed SSSP
• linear programming