2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2017★ 2 cited
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…
cs.CG2017
Covering Uncertain Points in a Tree
Haitao Wang, Jingru Zhang
In this paper, we consider a coverage problem for uncertain points in a tree. Let T be a tree containing a set P of n (weighted) demand points, and the location of each demand poin…
cs.CG2015★ 1 cited
Computing the Rectilinear Center of Uncertain Points in the Plane
Haitao Wang, Jingru Zhang
In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set of (weighted) uncertain points in the pl…