Yu Chen

activity

20232026

most citedOn

(1 + ε)

-Approximate Flow Sparsifiers

1 citations · 1 across the 9 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

cs.DS2024

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances

Yu Chen, Zihan Tan

We study the following distance realization problem. Given a quasi-metric $D$ on a set $T$ of terminals, does there exist a directed Okamura-Seymour graph that realizes $D$ as the…

cs.DS2024

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs

Yu Chen, Zihan Tan

We study vertex sparsification for preserving cuts. Given a graph $G$ with a subset $∣ T ∣ = k$ of its vertices called terminals, a \emph{quality- $q$ cut sparsifier} is a graph $G^{'}$ th…

cs.DS2024

Lower Bounds on $0$ -Extension with Steiner Nodes

Yu Chen, Zihan Tan

In the $0$ -Extension problem, we are given an edge-weighted graph $G = (V, E, c)$ , a set $T \subseteq V$ of its vertices called terminals, and a semi-metric $D$ over $T$ , and the goal i…

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs

Lower Bounds on 0-Extension with Steiner Nodes

Lower Bounds on $0$ -Extension with Steiner Nodes