Partitioning Colored Points into Monochromatic Islands is NP-Complete
Year: 2025
Type: conference-paper
Abstract: We are given a set S of colored points and a positive integer κ. A subset of S is monochromatic if it contains points of only one color. We prove that it is NP-complete to decide whether S can be partitioned into at most κ monochromatic subsets whose convex hulls are pairwise-disjoint.
Source: TU/e Research Portal
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: European Commission
OpenAlex ID: W7126326573
