Hung Le

collaborators

11 papers

cs.DS2026

Three trees suffice for a constant stretch in minor-free graphs

Hung Le, Huy Pham, Cuong Than +1

In this short note, we show that $H$ -minor-free graphs have a tree cover with $3$ trees and constant stretch for any fixed graph $H$ . The number of trees matches the recent lower b…

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

Planar Embedding of Okamura-Seymour Quasimetrics in Polynomial Time with an Application to Distributed SSSP

Hung Le, Hector Tierno, Shuang Yang

A quasi-metric $(T, I^´_{T})$ is an Okamura-Seymour quasimetric if there exists an edge-weighted planar embedded directed graph $G = (V, E, w)$ such that $T$ is a set of terminals on the…

cs.CG2026

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…