5 citations · 27 across the 31 of their papers we have counts for
9 papers · 1 filter
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound
Hung Le, Lazar Milenkovic, Shay Solomon
In STOC'95 [ADMSS'95] Arya et al. showed that any set of points in admits a -spanner with hop-diameter at most 2 (respectively, 3) and edges…
A Unified Framework of Light Spanners II: Fine-Grained Optimality
Hung Le, Shay Solomon
Seminal works on light spanners over the years provide spanners with optimal lightness in various graph classes, such as in general graphs, Euclidean spanners, and minor-free graph…
Optimal Approximate Distance Oracle for Planar Graphs
Hung Le, Christian Wulff-Nilsen
A -approximate distance oracle of an edge-weighted graph is a data structure that returns an approximate shortest path distance between any two query vertices up to a $(1+ε)…
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time
Hung Le, Shay Solomon
Let be a weighted undirected graph on vertices and edges, let be any integer, and let be any parameter. We present the following…
Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners
Omri Kahalon, Hung Le, Lazar Milenkovic +1
Spanners for metric spaces have been extensively studied, both in general metrics and in restricted classes, perhaps most notably in low-dimensional Euclidean spaces -- due to thei…
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…