Hung Le

activity

20242026

collaborators

Showing 2025 · cs.DSShow all

2 papers · 2 filters

cs.DS2025

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension

Timothy M. Chan, Hsien-Chih Chang, Jie Gao +3

We give the first truly subquadratic time algorithm, with $O^{*} (n^{2 - 1/18})$ running time, for computing the diameter of an $n$ -vertex unit-disk graph, resolving a central open prob…

cs.DS2025

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs

Hsien-Chih Chang, Jonathan Conroy, Hung Le +2

A $(1 + ε)$ -stretch tree cover of an edge-weighted $n$ -vertex graph $G$ is a collection of trees, where every pair of vertices has a $(1 + ε)$ -stretch path in one o…