First experimental study of dynamic greedy set cover algorithms reveals practical tradeoffs in quality and efficiency across real instances.
Journal of Industrial and Management Optimization 11, 575–594
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
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.
citing papers explorer
-
Engineering Algorithms for Dynamic Greedy Set Cover
First experimental study of dynamic greedy set cover algorithms reveals practical tradeoffs in quality and efficiency across real instances.
-
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.