Kernelization Algorithms for Packing Problems Allowing Overlaps

We consider the problem of discovering overlapping communities in networks which we model as generalizations of the Set and Graph Packing problems with overlap. As usual for Set Packing problems we seek a collection S'subset of S consisting of at least k sets subject to certain disjointness restrictions. In the r-Set Packing with t-Membership, each element of U belongs to at most t sets of S' while in r-Set Packing with t-Overlap each pair of sets in S' overlaps in at most t elements. For both problems, each set of S has at most r elements. Similarly, both of our graph packing problems seek a collection K of at least k subgraphs in a graph G each isomorphic to a graph H is an element of H where each member of H has at most r vertices. In H-Packing with t-Membership, each vertex of G belongs to at most t subgraphs of K while in H-Packing with t-Overlap each pair of subgraphs in K overlaps in at most t vertices. Here, we show NP-Completeness results for all of our packing problems. Furthermore, we give a dichotomy result for H-Packing with t-Membership analogous to the Kirkpatrick and Hell [12]. Given this intractability, we reduce r-Set Packing with t-Membership and t-Overlap to problem kernels with O((r+1)(r) k(r)) and O(r(r) k(r-t-1)) elements, respectively. Similarly, we reduce H-Packing with t-Membership and t-Overlap to instances with O((r +1)(r) k(r)) and O(r(r) k(r-t-1)) vertices, respectively. In all cases, k is the input parameter while t and r are constants.