An Efficient Branch-and-Bound Solver for Hitting Set

2021/10/22 by Bläsius, Thomas, Friedrich, Tobias, Stangl, David +1 · 2 citations
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.2110.11697

Abstract

The hitting set problem asks for a collection of sets over a universe U to find a minimum subset of U that intersects each of the given sets. It is NP-hard and equivalent to the problem set cover. We give a branch-and-bound algorithm to solve hitting set. Though it requires exponential time in the worst case, it can solve many practical instances from different domains in reasonable time. Our algorithm outperforms a modern ILP solver, the state-of-the-art for hitting set, by at least an order of magnitude on most instances.

Cited by

• Engineering Dominating Patterns: A Fine-grained Case Study
• A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets

Related

• A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets
• Greedy Heuristics and Linear Relaxations for the Random Hitting Set Problem
• The minimal hitting set generation problem: algorithms and computation
• Hitting Sets when the Shallow Cell Complexity is Small
• On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs\n Using 2-SAT