<p>It sounds like you're generalizing set cover to consider not just elements of S, but every size-M subset of S.  We can state the problem more generally:</p>

<p>"Given a set S, a collection C of subsets of S and a positive integer m, what is the smallest number of elements of C such that each size-M subset of S lies in one of the selected elements of C?"</p>

<p>This actually strikes me as being a fairly obvious generalization of set cover, and not one you'd need to spend time proving NP-complete beyond a single line.  After all, choosing m=1 recovers the original set cover problem.  Perhaps this more general formulation is good enough for your purposes to avoid needing to go into the details?</p>

<hr>

<p>Your question about an updated set of NP-completeness results is a good one, and deserves its own question. Crescenzi and Kann have put together a useful compendium <a href="http://www.ensta.fr/~diam/ro/online/viggo_wwwcompendium/wwwcompendium.html">online here</a>.</p>

<p>Second, it's hardly pervasive, but the Algorithms Design Manual by Steven Skiena is often a useful first stop for a large number of problems, and is available online <a href="http://www.cs.sunysb.edu/~algorith/">in part</a>. </p>

CC BY-SA 2.5
2010-08-16T23:19:51.093Z
I am interested only in m = 2.  It may be that there is a one line proof, but said proof escapes me.   I believe I stated that clearly in the second sentence of the question.
deinst
CC BY-SA 2.5
2010-08-17T03:23:28.620Z
Apologies; I didn't mean to suggest that there's a short proof in the pairwise case! The one-line proof I suggested is only in the general version of the problem: "the special case of m=1 recovers standard set cover".  

As you point out, the proof in the pairwise case is obvious (introduce dummy elements and sets to standard set cover to generate paired set cover), but yes, it would take a few lines to show it to be formal.  I'll see if I can find any references to it in the literature.
Anand Kulkarni
CC BY-SA 2.5
2010-08-16T20:57:29.213Z
2010-08-16T20:57:29.213Z
Anand Kulkarni
<p>To answer your second question, the <a href="http://www.csc.kth.se/~viggo/problemlist/" rel="noreferrer">Kahn-Crescenzi compendium of NP-hardness results</a> is a valuable source for hardness results, and also covers many variants of core G&amp;J problems. T<a href="http://www.csc.kth.se/~viggo/wwwcompendium/node146.html" rel="noreferrer">he entry for set cover</a> is a good example of this. </p>

CC BY-SA 2.5
2010-08-16T23:28:26.113Z
I had seen that before, and yes, it helps, but it does not even begin to scratch the surface of what has been proven NP-Complete. To give another example it took me much longer to find Uehara's proof that Vertex Cover was NP-complete on  a 3 connected cubic planar graph than it took me to prove it.  (Her proof was much cleaner than mine.)
deinst
CC BY-SA 2.5
2010-08-16T20:55:59.623Z
2010-08-16T20:55:59.623Z
Suresh Venkat
<p>What is the following variation on set cover known as?</p>

<p>Given a set S, a collection C of subsets of S and a positive integer K, do there exist K sets in C such that every pair of elements of S lies in one of the selected subsets.</p>

<p>Note: It is not hard to see that this problem is NP-Complete:  Given a normal set cover problem (S, C, K), make three copies of S, say S', S'', and S''',  then create your subsets as S''', |S| subsets of the form {a'} U {x in S'' | x != a} U {a'''}, |S| subsets of the form {a''} U {x in S' | x != a} U {a'''}, {a', a'' | a in C_i}.  Then we can solve the set cover problem with K subsets iff we can solve the pair cover problem with K + 1 + 2 |S| subsets.</p>

<p>This generalizes to triples, etc.  I would like to be able to not waste half a page proving this, and it is probably not obvious enough to dismiss as trivial.  It is certainly sufficiently useful that someone has proved it, but I have no idea who or where.</p>

<p>Also, is there a good place to look for NP-Completeness results that are not in Garey and Johnson?</p>

<np-hardness><set-cover><cc.complexity-theory>
What is the following variation on Set Cover known as?
deinst
# What is the following variation on Set Cover known as?

(Asked by: username_0 on 2010-08-16)

What is the following variation on set cover known as?

Given a set S, a collection C of subsets of S and a positive integer K, do there exist K sets in C such that every pair of elements of S lies in one of the selected subsets.

Note: It is not hard to see that this problem is NP-Complete: Given a normal set cover problem (S, C, K), make three copies of S, say S', S'', and S''', then create your subsets as S''', |S| subsets of the form {a'} U {x in S'' | x != a} U {a'''}, |S| subsets of the form {a''} U {x in S' | x != a} U {a'''}, {a', a'' | a in C\_i}. Then we can solve the set cover problem with K subsets iff we can solve the pair cover problem with K + 1 + 2 |S| subsets.

This generalizes to triples, etc. I would like to be able to not waste half a page proving this, and it is probably not obvious enough to dismiss as trivial. It is certainly sufficiently useful that someone has proved it, but I have no idea who or where.

Also, is there a good place to look for NP-Completeness results that are not in Garey and Johnson?

**Tags:** np-hardness, set-cover, cc.complexity-theory

---

## 2 answers

### Answer by username_1 on 2010-08-16. Score: 7

It sounds like you're generalizing set cover to consider not just elements of S, but every size-M subset of S. We can state the problem more generally:

"Given a set S, a collection C of subsets of S and a positive integer m, what is the smallest number of elements of C such that each size-M subset of S lies in one of the selected elements of C?"

This actually strikes me as being a fairly obvious generalization of set cover, and not one you'd need to spend time proving NP-complete beyond a single line. After all, choosing m=1 recovers the original set cover problem. Perhaps this more general formulation is good enough for your purposes to avoid needing to go into the details?

---

Your question about an updated set of NP-completeness results is a good one, and deserves its own question. Crescenzi and Kann have put together a useful compendium [online here](http://www.ensta.fr/~diam/ro/online/viggo_wwwcompendium/wwwcompendium.html).

Second, it's hardly pervasive, but the Algorithms Design Manual by Steven Skiena is often a useful first stop for a large number of problems, and is available online [in part](http://www.cs.sunysb.edu/~algorith/).

> **Comments:**
> **username_0**: I am interested only in m = 2.  It may be that there is a one line proof, but said proof escapes me.   I believe I stated that clearly in the second sentence of the question.  
> **username_1**: Apologies; I didn't mean to suggest that there's a short proof in the pairwise case! The one-line proof I suggested is only in the general version of the problem: "the special case of m=1 recovers standard set cover".    As you point out, the proof in the pairwise case is obvious (introduce dummy elements and sets to standard set cover to generate paired set cover), but yes, it would take a few lines to show it to be formal.  I'll see if I can find any references to it in the literature.  

---

### Answer by username_2 on 2010-08-16. Score: 7

To answer your second question, the [Kahn-Crescenzi compendium of NP-hardness results](http://www.csc.kth.se/~viggo/problemlist/) is a valuable source for hardness results, and also covers many variants of core G&J problems. T[he entry for set cover](http://www.csc.kth.se/~viggo/wwwcompendium/node146.html) is a good example of this.

> **Comments:**
> **username_0**: I had seen that before, and yes, it helps, but it does not even begin to scratch the surface of what has been proven NP-Complete. To give another example it took me much longer to find Uehara's proof that Vertex Cover was NP-complete on  a 3 connected cubic planar graph than it took me to prove it.  (Her proof was much cleaner than mine.)  

---

