1 citations · 1 across the 9 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Paths and Intersections: Repelling Pairs
Yu Chen, Pavlo Pylyavskyy, Zihan Tan
We study two inverse problems for shortest-path metrics of Okamura-Seymour instances: recognizing metrics realizable by outerplanar graphs, and computing minimum-edge Okamura-Seymo…
cs.DS2026
Paths and Intersections: Recognizing Outerplanar Metrics
Yu Chen, Zihan Tan
We study the following distance realization problem: given a metric on a set of terminals, does there exist an (edge-weighted) outerplanar graph , such that $T\subseteq…
cs.DS2026
Lower Bounds on Flow Sparsifiers with Steiner Nodes
Yu Chen, Zihan Tan, Mingyang Yang
Given a large graph with a set of its vertices called terminals, a \emph{quality- flow sparsifier} is a small graph that contains the terminals and preserves all mu…