O(n^3 log n) algorithm computes maximum (weighted) independent sets for disk graphs with all disks on the convex hull, plus O(n^3 log^2 n) for k-dispersion on the same inputs.
Agarwal, Marc J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
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.
citing papers explorer
-
Maximum Independent Sets in Disk Graphs with Disks in Convex Position
O(n^3 log n) algorithm computes maximum (weighted) independent sets for disk graphs with all disks on the convex hull, plus O(n^3 log^2 n) for k-dispersion on the same inputs.
-
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.