Research5d ago
Universe Decomposability Boosts Set Cover Heuristics
The paper presents a preprocessing step that uses disjoint‑set union to find connected components in the universe. This decomposition, called universe segmentability, exposes hidden structure in Minimum Set Cover instances that most algorithms ignore. Applying the method lets solvers prune large portions of the search space, speeding metaheuristics and improving solution quality.