Partial Set Cover is inapproximable below factor 2 even at VC-dimension 7, while bounded semi-ladder index restores a k+1-sets covering target and yields new EPAS results.
Improved Performance of the Greedy Algorithm for Partial Cover
1 Pith paper cite this work, alongside 114 external citations. Polarity classification is still indexing.
1
Pith paper citing it
114
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension
Partial Set Cover is inapproximable below factor 2 even at VC-dimension 7, while bounded semi-ladder index restores a k+1-sets covering target and yields new EPAS results.