Tianyi Zhang

activity

20242026

most citedVizing's Theorem in Near-Linear Time

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

collaborators

Showing cs.CGShow all

5 papers · 1 filter

cs.CG2026

Improved Euclidean Shallow Light Trees

Hung Le, Shay Solomon, Cuong Than +2

For parameters $α, β \geq 1$ , a spanning tree $T$ of a weighted graph $G$ rooted at a designated vertex $r$ is called an $(α, β)$ -shallow-light tree (SLT) if (i) for every vertex $v$ ,…

cs.CG2025

Approximating Euclidean Shallow-Light Trees

Hung Le, Shay Solomon, Cuong Than +2

For a weighted graph $G = (V, E, w)$ and a designated source vertex $s \in V$ , a spanning tree that simultaneously approximates a shortest-path tree w.r.t. source $s$ and a minimum…

cs.CG2025

Covering the Euclidean Plane by a Pair of Trees

Hung Le, Lazar Milenković, Shay Solomon +1

A { $t$ -stretch tree cover} of a metric space $M = (X, δ)$ , for a parameter $t \geq 1$ , is a collection of trees such that every pair of points has a $t$ -stretch path in one of the tr…

cs.CG2025

Optimal Bounds for Spanners and Tree Covers in Doubling Metrics

An La, Hung Le, Shay Solomon +4

It is known that any $n$ -point set in the $d$ -dimensional Euclidean space $R^{d}$ , for $d = O (1)$ , admits: 1) a $(1 + ε)$ -spanner with maximum degree $O ~ (ε^{- d + 1})$ and…

cs.CG2024

Towards Instance-Optimal Euclidean Spanners

Hung Le, Shay Solomon, Cuong Than +2

Euclidean spanners are important geometric objects that have been extensively studied since the 1980s. The two most basic "compactness'' measures of a Euclidean spanner $E$ are the…