3 papers
cs.CG2021
Red blue -center clustering with distance constraints
M. Eskandari, B. B. Khare, N. Kumar
We consider a variant of the -center clustering problem in , where the centers can be divided into two subsets, one, the red centers of size , and the other, the blue…
cs.CG2021
Lower Bound for Sculpture Garden Problem
Marzieh Eskandari, Bahram Sadeghi Bigham
The purpose of the current study is to investigate a special case of art gallery problem, namely Sculpture Garden Problem. In the said problem, for a given polygon , the ultimat…
cs.CG2021
Separated Red Blue Center Clustering
Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar
We study a generalization of -center clustering, first introduced by Kavand et. al., where instead of one set of centers, we have two types of centers, red and blue, and…