Module setcover 

Set Cover problem solvers

The set cover problem: find minimum cost collection of sets that covers all elements.

Algorithms

• Greedy: O(n²) approximation with ln(n) guarantee
• Local search: Improve greedy solution

Structs

SetCoverProblem

A set cover problem instance

SetCoverSolution

Solution to a set cover problem

Functions

greedy

Greedy set cover algorithm

solve

Solve set cover using greedy algorithm