10 citations · 11 across the 4 of their papers we have counts for
4 papers
Improved Time Complexity of Bandwidth Approximation in Dense Graphs
Hao-Hsiang Hung
Given a graph and and a proper labeling from to , we define as the maximum absolute difference between and where …
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+ε…
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…
Finding Light Spanners in Bounded Pathwidth Graphs
Michelangelo Grigni, Hao-Hsiang Hung
Given an edge-weighted graph and , a -spanner is a spanning subgraph whose shortest path distances approximate those of within a factor. If is…