15 citations · 74 across the 39 of their papers we have counts for
7 papers · 1 filter
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…
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…
Algorithms for Covering Multiple Barriers
Shimin Li, Haitao Wang
In this paper, we consider the problems for covering multiple intervals on a line. Given a set of line segments (called "barriers") on a horizontal line and another set…
Quickest Visibility Queries in Polygonal Domains
Haitao Wang
Let be a point in a polygonal domain of holes and vertices. We consider a quickest visibility query problem. Given a query point in , t…
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
Haitao Wang
Given a rectilinear domain of pairwise-disjoint rectilinear obstacles with a total of vertices in the plane, we study the problem of computing bicriteria rect…
Linear Time Approximation Schemes for Geometric Maximum Coverage
Kai Jin, Jian Li, Haitao Wang +2
We study approximation algorithms for the following geometric version of the maximum coverage problem: Let be a set of weighted points in the plane. Let repre…
Improved Algorithms For Structured Sparse Recovery
Lingxiao Huang, Yifei Jin, Jian Li +1
It is known that certain structures of the signal in addition to the standard notion of sparsity (called structured sparsity) can improve the sample complexity in several compressi…