Geometric max coverage is approximable strictly better than 1−1/e by combining LP rounding with a greedy warm-up, for every family with linear 2-shallow cell complexity; the paper also gives faster FPT-AS, an EPTAS for continuous fat shapes, and matching hardness.
Geometric Packing under Nonuniform Constraints
1 Pith paper cite this work, alongside 3 external citations. Polarity classification is still indexing.
1
Pith paper citing it
3
external citations · OpenAlex
fields
cs.CG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Approximation Algorithms for Geometric Maximum Coverage
Geometric max coverage is approximable strictly better than 1−1/e by combining LP rounding with a greedy warm-up, for every family with linear 2-shallow cell complexity; the paper also gives faster FPT-AS, an EPTAS for continuous fat shapes, and matching hardness.