Questions tagged [set-cover]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
8
votes
1answer
210 views

Specific algorithms to compute the LP-relaxation of the Set-Cover problem

One of the most commonly known combinatorial problems is the set cover problem, which states that given a collection of sets $S = \{s_1, \dots, s_m\}$ and a universe of elements $U = \bigcup_{i=1}^m ...