<p>I am interested in the best currently known algorithm (in fact, any relevant reference) for the following problem:</p>

<blockquote>
  <p>Given a  family of subsets $S_1,S_2,\ldots S_N\subseteq \{1,2,\ldots N\}$,    determine if there is a pair of disjoint subsets $S_i\cap S_j=\emptyset$.</p>
</blockquote>

<p>This is the $k=2$ case of set packing problem; by taking complements, we obtain the $k=2$ set cover problem. An obvious generalization considers $M$ subsets.  </p>

<p>There is a straightforward reduction to matrix multiplication: if $B$ is the incidence matrix of the family $\{S_1,\ldots S_N\}$, then we can check if $BB^T$ has a zero element in $O(N^{2.373})$ time. </p>

<p>Curiously enough, the only discussion of this problem in literature I was able to come by was an elementary textbook by Kleinberg and Tardos where it was given as an example of $O(N^3)$ complexity, followed by "For this problem, there are algorithms that improve on $O(N^3)$ running time, but they are quite complicated. Furthermore, it is not clear whether the improved algorithms for this problem are practical on inputs of reasonable size". The wording, however, suggests that matrix multiplication was assumed.</p>

<ul>
<li>Is there a $O(N^2\mathrm{polylog}(N))$ algorithm for this problem? Conversely, would such an algorithm necessarily imply an improvement in matrix multiplication?</li>
<li>Assume we restrict the algorithm to decision trees in some way in order to exclude integer arithmetic and thus fast matrix multiplication. Are there nontrivial lower bounds for this case?</li>
<li>A weakened version is equivalent to testing whether a given graph has diameter at least $3$. Is this problem known to be easier than all-pairs-shortest-paths?</li>
</ul>

CC BY-SA 3.0
2016-09-30T22:36:38.987Z
This appears very closely related to boolean matrix multiplication. In particular, a lower bound for combinatorial algorithms for this problem would imply lower bounds for combinatorial algorithms for BMM.
Sasho Nikolov
CC BY-SA 3.0
2016-10-03T13:07:36.260Z
The problem appears to be equivalent to the 2-dominating set problem for which $O(n^\omega)$ is the fastest known. This follows since a graph $G$ with adjacency matrix $M$ has a 2-dominating set if and only if there are at least two rows in the complement $\overline{M}$ of its adjacency matrix which are disjoint. See "On the complexity of fixed parameter clique and dominating set" by Eisenbrand and Grandoni for a paper stating that nothing faster than $O(n^\omega)$ is known for 2-dominating set. See also "On the possibility of faster SAT algorithms" by Patrascu and Williams.
JWM
<ds.algorithms><reference-request>
Complexity of $k=2$ set packing
Manashi
# Complexity of $k=2$ set packing

(Asked by: username_0 on 2016-09-30)

I am interested in the best currently known algorithm (in fact, any relevant reference) for the following problem:

> Given a family of subsets $S\_1,S\_2,\ldots S\_N\subseteq \{1,2,\ldots N\}$, determine if there is a pair of disjoint subsets $S\_i\cap S\_j=\emptyset$.

This is the $k=2$ case of set packing problem; by taking complements, we obtain the $k=2$ set cover problem. An obvious generalization considers $M$ subsets.

There is a straightforward reduction to matrix multiplication: if $B$ is the incidence matrix of the family $\{S\_1,\ldots S\_N\}$, then we can check if $BB^T$ has a zero element in $O(N^{2.373})$ time.

Curiously enough, the only discussion of this problem in literature I was able to come by was an elementary textbook by Kleinberg and Tardos where it was given as an example of $O(N^3)$ complexity, followed by "For this problem, there are algorithms that improve on $O(N^3)$ running time, but they are quite complicated. Furthermore, it is not clear whether the improved algorithms for this problem are practical on inputs of reasonable size". The wording, however, suggests that matrix multiplication was assumed.

* Is there a $O(N^2\mathrm{polylog}(N))$ algorithm for this problem? Conversely, would such an algorithm necessarily imply an improvement in matrix multiplication?
* Assume we restrict the algorithm to decision trees in some way in order to exclude integer arithmetic and thus fast matrix multiplication. Are there nontrivial lower bounds for this case?
* A weakened version is equivalent to testing whether a given graph has diameter at least $3$. Is this problem known to be easier than all-pairs-shortest-paths?

**Tags:** ds.algorithms, reference-request

> **Comments:**
> **username_1**: This appears very closely related to boolean matrix multiplication. In particular, a lower bound for combinatorial algorithms for this problem would imply lower bounds for combinatorial algorithms for BMM.  
> **username_2**: The problem appears to be equivalent to the 2-dominating set problem for which $O(n^\omega)$ is the fastest known. This follows since a graph $G$ with adjacency matrix $M$ has a 2-dominating set if and only if there are at least two rows in the complement $\overline{M}$ of its adjacency matrix which are disjoint. See "On the complexity of fixed parameter clique and dominating set" by Eisenbrand and Grandoni for a paper stating that nothing faster than $O(n^\omega)$ is known for 2-dominating set. See also "On the possibility of faster SAT algorithms" by Patrascu and Williams.  

---

## 0 answers

