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 2023 · cs.DSShow all

3 papers · 2 filters

cs.DS2023

An $Ω ~ (lo g ∣ T ∣)$ Lower Bound for Steiner Point Removal

Yu Chen, Zihan Tan

In the Steiner point removal (SPR) problem, we are given a (weighted) graph $G$ and a subset $T$ of its vertices called terminals, and the goal is to compute a (weighted) graph $H$ …

cs.DS2023★ 1 cited

On $(1 + ε)$ -Approximate Flow Sparsifiers

Yu Chen, Zihan Tan

Given a large graph $G$ with a subset $∣ T ∣ = k$ of its vertices called terminals, a quality- $q$ flow sparsifier is a small graph $G^{'}$ that contains $T$ and preserves all multicommodi…

cs.DS2023

Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families

Yu Chen, Zihan Tan

We study the following characterization problem. Given a set $T$ of terminals and a $(2^{∣ T ∣} - 2)$ -dimensional vector $π$ whose coordinates are indexed by proper subsets of $T$ , is…

An Ω~(log∣T∣​) Lower Bound for Steiner Point Removal

On (1+ε)-Approximate Flow Sparsifiers

Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families

An $Ω ~ (lo g ∣ T ∣)$ Lower Bound for Steiner Point Removal

On $(1 + ε)$ -Approximate Flow Sparsifiers