Abstract
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 \(\mathcal {S}' \subseteq \mathcal {S}\) consisting of at least \(k\) sets subject to certain disjointness restrictions. In the \(r\)-Set Packing with \(t\)-Membership, each element of \(\mathcal {U}\) belongs to at most \(t\) sets of \(\mathcal {S'}\) while in \(r\)-Set Packing with \(t\)-Overlap each pair of sets in \(\mathcal {S'}\) overlaps in at most \(t\) elements. For both problems, each set of \(\mathcal {S}\) has at most \(r\) elements.
Similarly, both of our graph packing problems seek a collection \(\mathcal {K}\) of at least \(k\) subgraphs in a graph \(G\) each isomorphic to a graph \(H \in \mathcal {H}\) where each member of \(\mathcal {H}\) has at most \(r\) vertices. In \(\mathcal {H}\)-Packing with \(t\)-Membership, each vertex of \(G\) belongs to at most \(t\) subgraphs of \(\mathcal {K}\) while in \(\mathcal {H}\)-Packing with \(t\)-Overlap each pair of subgraphs in \(\mathcal {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 \(\mathcal {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 \(\mathcal {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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abu-Khzam, F.N.: An improved kernelization algorithm for \(r\)-set packing. Inf. Process. Lett. 110(16), 621–624 (2010)
Banerjee, S., Khuller, S.: A clustering scheme for hierarchical control in multi-hop wireless networks. In: Proceedings of 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), vol. 2, pp. 1028–1037. IEEE Society Press (2001)
Bodlaender, H.L., Thomassé, S., Yeo, A.: Analysis of data reduction: transformations give evidence for non-existence of polynomial kernels. Technical report. UU-CS-2008-030, Department of Information and Computer Sciences, Utrecht University (2008)
Dell, H., Marx, D.: Kernelization of packing problems. In: Rabani, Y. (ed.) Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. pp. 68–81. SIAM (2012)
Fellows, M., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graph-based data clustering with overlaps. Discrete Optim. 8(1), 2–17 (2011)
Fellows, M., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica 52(2), 167–176 (2008)
Fellows, M., Heggernes, P., Rosamond, F.A., Sloper, C., Telle, J.A.: Finding k disjoint triangles in an arbitrary graph. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 235–244. Springer, Heidelberg (2004)
Fernau, H., López-Ortiz, A., Romero, J.: Kernelization algorithms for packing problems allowing overlaps (Extended Version) (2014). arXiv:1411.6915
Fernau, H., Raible, D.: A parameterized perspective on packing paths of length two. J. Comb. Optim. 18(4), 319–341 (2009)
Giannopoulou, A.C., Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: Uniform kernelization complexity of hitting forbidding minors (2014, unpublished). http://www.win.tue.nl/~bjansen/publications.html
Jansen, B.M.P., Marx, D.: Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. CoRR abs/1410.0855 (2014)
Kirkpatrick, D., Hell, P.: On the completeness of a generalized matching problem. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing (STOC), pp. 240–245 (1978)
Micali, S., Vazirani, V.V.: An \(O(\sqrt{|V|}|E|)\) algorithm for finding maximum matching in general graphs. In: Proceedings of the 21st Annual Symposium on Foundations of Computer Science, SFCS 1980, pp. 17–27. IEEE Computer Society (1980)
Moser, H.: A problem kernelization for graph packing. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 401–412. Springer, Heidelberg (2009)
Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)
Prieto, E., Sloper, C.: Looking at the stars. Theoret. Comput. Sci. 351(3), 437–445 (2006)
Romero, J., López-Ortiz, A.: The \({\cal G}\)-packing with t-overlap problem. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 114–124. Springer, Heidelberg (2014)
Romero, J., López-Ortiz, A.: A parameterized algorithm for packing overlapping subgraphs. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J.É., Vereshchagin, N.K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 325–336. Springer, Heidelberg (2014)
Shiloach, Y.: Another look at the degree constrained subgraph problem. Inf. Process. Lett. 12(2), 89–92 (1981)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fernau, H., López-Ortiz, A., Romero, J. (2015). Kernelization Algorithms for Packing Problems Allowing Overlaps. In: Jain, R., Jain, S., Stephan, F. (eds) Theory and Applications of Models of Computation. TAMC 2015. Lecture Notes in Computer Science(), vol 9076. Springer, Cham. https://doi.org/10.1007/978-3-319-17142-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-17142-5_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17141-8
Online ISBN: 978-3-319-17142-5
eBook Packages: Computer ScienceComputer Science (R0)