2 citations · 4 across the 12 of their papers we have counts for
7 papers · 1 filter
Improved Euclidean Shallow Light Trees
Hung Le, Shay Solomon, Cuong Than +2
For parameters , a spanning tree of a weighted graph rooted at a designated vertex is called an -shallow-light tree (SLT) if (i) for every vertex ,…
Approximating Euclidean Shallow-Light Trees
Hung Le, Shay Solomon, Cuong Than +2
For a weighted graph and a designated source vertex , a spanning tree that simultaneously approximates a shortest-path tree w.r.t. source and a minimum…
Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
An La, Hung Le, Shay Solomon +4
It is known that any -point set in the -dimensional Euclidean space , for , admits: 1) a -spanner with maximum degree and…
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 are the…
Optimal Euclidean Tree Covers
Hsien-Chih Chang, Jonathan Conroy, Hung Le +3
A of a metric space is a collection of trees, where every pair of points has a -stretch path in one of the trees. The…
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Lightness Barrier
Hung Le, Shay Solomon, Cuong Than
An essential requirement of spanners in many applications is to be fault-tolerant: a -spanner of a metric space is called (vertex) -fault-tolerant (-FT) if it remains…
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
Hung Le, Cuong Than
The greedy spanner in a low dimensional Euclidean space is a fundamental geometric construction that has been extensively studied over three decades as it possesses the two most ba…