Is there an algorithm for finding minimal covers of a set of sets in which each element of the universe appears in exactly 2 sets? I realize that LP relaxation approximates this to within a factor of 2.
Minimum cover for sets in which each element appears in exactly 2 sets?
Victor Rielly
- 73
- 4