Hung Le

most citedFine-Grained Complexity of Continuous Euclidean k-Center

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

collaborators

Showing cs.CGShow all

6 papers · 1 filter

cs.CG2026

Improved Euclidean Shallow Light Trees

Hung Le, Shay Solomon, Cuong Than +3

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.CG2026★ 1 cited

Fine-Grained Complexity of Continuous Euclidean k-Center

Lotte Blank, Karl Bringmann, Parinya Chalermsook +4

In the (continuous) Euclidean $k$ -center problem, given $n$ points in $R^{d}$ and an integer $k$ , the goal is to find $k$ center points in $R^{d}$ that minimize the m…

cs.CG2026

A Polynomial Coreset for Furthest Neighbor in Planar Metrics

Kacper Kluk, Hung Le, Wojciech Nadara +3

A furthest neighbor data structure on a metric space $(V, dist)$ and a set $P \subseteq V$ answers the following query: given $v \in V$ , output $p \in P$ maximizing $\mathr…

cs.CG2026

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 + I^µ)$ -spanner with maximum degree $O ~ (I^µ^{- d + 1})$ a…

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, I^´)$ , 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 t…