Decomposing minimum set cover instances into independent components via union-find and solving them with GRASP improves solution quality and scalability on large decomposable cases.
Operations Research 44, 875–890
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Structural Segmentation of the Minimum Set Cover Problem: Exploiting Universe Decomposability for Metaheuristic Optimization
Decomposing minimum set cover instances into independent components via union-find and solving them with GRASP improves solution quality and scalability on large decomposable cases.