most citedLinear Time Approximation Schemes for Geometric Maximum Coverage

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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…