Proves NP-hardness of selecting a maximum centre-disjoint subset of disks with merging of the rest and gives ILP plus linear-time algorithm for collinear centers.
Maximizing the Number of Visible Labels on a Rot ating Map
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Maximum Centre-Disjoint Mergeable Disks
Proves NP-hardness of selecting a maximum centre-disjoint subset of disks with merging of the rest and gives ILP plus linear-time algorithm for collinear centers.