15 citations · 17 across the 3 of their papers we have counts for
3 papers
cs.DS2022
Efficient Algorithms for Obnoxious Facility Location on a Line Segment or Circle
Bowei Zhang
We study different restricted variations of the obnoxious facility location problem on a plane. The first is the constrained obnoxious facility location on a line segment (COFL-Lin…
cs.CG2017★ 15 cited
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…
cs.CG2015★ 2 cited
Linear Time Approximation Schemes for Geometric Maximum Coverage
Jian Li, Haitao Wang, Bowei Zhang +1
We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. We want to place m a * b re…