5 citations · 21 across the 20 of their papers we have counts for
6 papers · 1 filter
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees
Haitao Wang, Yiming Zhao
We consider the problem of computing the diameter of a unicycle graph (i.e., a graph with a unique cycle). We present an O(n) time algorithm for the problem, where n is the number…
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
Haitao Wang, Yiming Zhao
Let be a path graph of vertices embedded in a metric space. We consider the problem of adding a new edge to so that the radius of the resulting graph is minimized, wher…
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
Christopher Johnson, Haitao Wang
Let be a path graph of vertices embedded in a metric space. We consider the problem of adding a new edge to to minimize the radius of the resulting graph. Previously, a…
An -Time Algorithm for the k-Center Problem in Trees
Haitao Wang, Jingru Zhang
We consider a classical k-center problem in trees. Let T be a tree of n vertices and every vertex has a nonnegative weight. The problem is to find k centers on the edges of T such…
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
Haitao Wang
Let be a path graph of vertices embedded in a metric space. We consider the problem of adding a new edge to such that the diameter of the resulting graph is minimized.…
Matroid and Knapsack Center Problems
Danny Z. Chen, Jian Li, Hongyu Liang +1
In the classic -center problem, we are given a metric graph, and the objective is to open nodes as centers such that the maximum distance from any vertex to its closest cent…