1.3k citations
- Universidad Autónoma de MadridES24 papers
- Université de Bretagne SudFR21 papers
- Max Planck Institute for Gravitational PhysicsDE19 papers
- University of Wisconsin–MilwaukeeUS15 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- Pennsylvania State UniversityUS14 papers
- Tsinghua UniversityCN14 papers
- The University of Texas at AustinUS13 papers
- University of MichiganUS13 papers
- California Institute of TechnologyUS12 papers
- Goddard Space Flight CenterUS12 papers
- Instituto de Física TeóricaES12 papers
4 papers · 2 filters
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…
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…