2 papers
cs.DS2026
Planar Embedding of Okamura-Seymour Quasimetrics in Polynomial Time with an Application to Distributed SSSP
Hung Le, Hector Tierno, Shuang Yang
A quasi-metric is an Okamura-Seymour quasimetric if there exists an edge-weighted planar embedded directed graph such that is a set of terminals on the…
cs.CG2026
A Polynomial Coreset for Furthest Neighbor in Planar Metrics
Kacper Kluk, Hung Le, Wojciech Nadara +3
A furthest neighbor data structure on a metric space and a set answers the following query: given , output maximizing $\mathr…