Hao-Hsiang Hung

most citedLight Spanner and Monotone Tree

10 citations · 10 across the 3 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2012

Improved Time Complexity of Bandwidth Approximation in Dense Graphs

Hao-Hsiang Hung

Given a graph $G = (V, E)$ and and a proper labeling $f$ from $V$ to ${1, ..., n}$ , we define $B (f)$ as the maximum absolute difference between $f (u)$ and $f (v)$ where $(u, v) \in E$ …

cs.DS2012

Survival Network Design of Doubling Dimension Metrics

Hao-Hsiang Hung

We investigate the Minimum Weight 2-Edge-Connected Spanning Subgraph (2-ECSS) problem in an arbitrary metric space of doubling dimension and show a polynomial time randomized $(1+ε…

cs.DS2012★ 10 cited

Light Spanner and Monotone Tree

Hao-Hsiang Hung

In approximation algorithm design, light spanners has applications in graph-metric problems such as metric TSP (the traveling salesman problem). We have developed an efficient algo…