2020/10/29 by Marc Alexa, Alexa, Marc
Computer Science · Engineering · #90C09 #90C27 #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #Medical Image Segmentation Techniques #Sparse and Compressive Sensing Techniques
paper · pdf · doi:10.48550/arxiv.2010.15476
openalex publication_date 2020/10/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We empirically analyze a simple heuristic for large sparse set cover problems. It uses the weighted greedy algorithm as a basic building block. By multiplicative updates of the weights attached to the elements, the greedy solution is iteratively improved. The implementation of this algorithm is trivial and the algorithm is essentially free of parameters that would require tuning. More iterations can only improve the solution. This set of features makes the approach attractive for practical problems.