2 citations · 3 across the 4 of their papers we have counts for
4 papers
Lower Bounds on -Extension with Steiner Nodes
Yu Chen, Zihan Tan
In the -Extension problem, we are given an edge-weighted graph , a set of its vertices called terminals, and a semi-metric over , and the goal i…
An Lower Bound for Steiner Point Removal
Yu Chen, Zihan Tan
In the Steiner point removal (SPR) problem, we are given a (weighted) graph and a subset of its vertices called terminals, and the goal is to compute a (weighted) graph …
On -Approximate Flow Sparsifiers
Yu Chen, Zihan Tan
Given a large graph with a subset of its vertices called terminals, a quality- flow sparsifier is a small graph that contains and preserves all multicommodi…
On the Meeting Time for Two Random Walks on a Regular Graph
Yizhen Zhang, Zihan Tan, Bhaskar Krishnamachari
We provide an analysis of the expected meeting time of two independent random walks on a regular graph. For 1-D circle and 2-D torus graphs, we show that the expected meeting time…