First experimental study of dynamic greedy set cover algorithms reveals practical tradeoffs in quality and efficiency across real instances.
Amitai Uzrad 19 A Appendix Figure 3Performance profiles for each algorithm evaluated across all three quality metrics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.