Hung Le

collaborators

4 papers

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.DS2025

Tree-Like Shortcuttings of Trees

Hung Le, Lazar Milenković, Shay Solomon +1

Sparse shortcuttings of trees -- equivalently, sparse 1-spanners for tree metrics with bounded hop-diameter -- have been studied extensively (under different names and settings), s…

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.DS2025

Approximate Light Spanners in Planar Graphs

Hung Le, Shay Solomon, Cuong Than +2

In their seminal paper, Althöfer et al. (DCG 1993) introduced the {\em greedy spanner} and showed that, for any weighted planar graph $G$ , the weight of the greedy $(1 + ε)$ -spanner…