Hossein Ghasemalizadeh

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A set of points and a positive integer m are given and our goal is to cover the maximum number of these point with m disks. We devise the first output sensitive algorithm for this problem. We introduce a parameter ρ as the maximum number of points that one disk can cover. In this paper first we solve the problem for m = 2 in O(nρ + ρ 3 log ρ)) time. The(More)
In this paper we present a polynomial time approximation scheme for the most points covering problem. In the most points covering problem, n points in R 2, r>0, and an integer m>0 are given and the goal is to cover the maximum number of points with m disks with radius r. The dual of the most points covering problem is the partial covering problem in which n(More)
  • 1