Corpus ID: 236155268

Separating Colored Points with Minimum Number of Rectangles

@article{Assadian2021SeparatingCP,
  title={Separating Colored Points with Minimum Number of Rectangles},
  author={Navid Assadian and Sima Hajiaghaei Shanjani and Alireza Zarei},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.09821}
}
In this paper we study the following problem: Given k disjoint sets of points, P1, . . . , Pk on the plane, find a minimum cardinality set T of arbitrary rectangles such that each rectangle contains points of just one set Pi but not the others. We prove the NP-hardness of this problem. 

Figures from this paper

References

SHOWING 1-2 OF 2 REFERENCES
The class cover problem with boxes
TLDR
It is proved that the problem remains NP-hard if the covering boxes are half-strips oriented in any of the four orientations, and it is shown that there exists an O(1)-approximation algorithm. Expand
Reducibility Among Combinatorial Problems Proceedings of a symposium on the Complexity of Computer Computations
  • 1972