{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:28Z","timestamp":1759638508325,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T00:00:00Z","timestamp":1435276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Theory"],"published-print":{"date-parts":[[2015,7,9]]},"abstract":"<jats:p>\n            We consider the problem of discovering overlapping communities in networks that we model as generalizations of the Set and Graph Packing problems with overlap. As usual for Set Packing problems, we seek a collection\n            <jats:italic>\n              S\n              <jats:sup>\u2032<\/jats:sup>\n            <\/jats:italic>\n            \u2286\n            <jats:italic>S<\/jats:italic>\n            consisting of at least\n            <jats:italic>k<\/jats:italic>\n            sets subject to certain disjointness restrictions. In the\n            <jats:italic>r<\/jats:italic>\n            -Set Packing with\n            <jats:italic>t<\/jats:italic>\n            -Membership, each element of\n            <jats:italic>U<\/jats:italic>\n            belongs to at most\n            <jats:italic>t<\/jats:italic>\n            sets of\n            <jats:italic>\n              S\n              <jats:sup>\u2032<\/jats:sup>\n            <\/jats:italic>\n            , while in\n            <jats:italic>r<\/jats:italic>\n            -Set Packing with\n            <jats:italic>t<\/jats:italic>\n            -Overlap, each pair of sets in\n            <jats:italic>\n              S\n              <jats:sup>\u2032<\/jats:sup>\n            <\/jats:italic>\n            overlaps in at most\n            <jats:italic>t<\/jats:italic>\n            elements. For both problems, each set of\n            <jats:italic>S<\/jats:italic>\n            has at most\n            <jats:italic>r<\/jats:italic>\n            elements.\n          <\/jats:p>\n          <jats:p>\n            Similarly, both of our Graph Packing problems seek a collection\n            <jats:italic>K<\/jats:italic>\n            of at least\n            <jats:italic>k<\/jats:italic>\n            subgraphs in a graph\n            <jats:italic>G<\/jats:italic>\n            , each isomorphic to a graph\n            <jats:italic>H<\/jats:italic>\n            \u2208\n            <jats:italic>H<\/jats:italic>\n            . In\n            <jats:italic>H<\/jats:italic>\n            -Packing with\n            <jats:italic>t<\/jats:italic>\n            -Membership, each vertex of\n            <jats:italic>G<\/jats:italic>\n            belongs to at most\n            <jats:italic>t<\/jats:italic>\n            subgraphs of\n            <jats:italic>K<\/jats:italic>\n            , while in\n            <jats:italic>H<\/jats:italic>\n            -Packing with\n            <jats:italic>t<\/jats:italic>\n            -Overlap, each pair of subgraphs in\n            <jats:italic>K<\/jats:italic>\n            overlaps in at most\n            <jats:italic>t<\/jats:italic>\n            vertices. For both problems, each member of\n            <jats:italic>H<\/jats:italic>\n            has at most\n            <jats:italic>r<\/jats:italic>\n            vertices and\n            <jats:italic>m<\/jats:italic>\n            edges, where\n            <jats:italic>t<\/jats:italic>\n            ,\n            <jats:italic>r<\/jats:italic>\n            , and\n            <jats:italic>m<\/jats:italic>\n            are constants.\n          <\/jats:p>\n          <jats:p>\n            Here, we show NP-completeness results for all of our packing problems. Furthermore, we give a dichotomy result for the\n            <jats:italic>H<\/jats:italic>\n            -Packing with\n            <jats:italic>t<\/jats:italic>\n            -Membership problem analogous to the Kirkpatrick and Hell dichotomy [Kirkpatrick and Hell 1978]. Using polynomial parameter transformations, we reduce the\n            <jats:italic>r<\/jats:italic>\n            -Set Packing with\n            <jats:italic>t<\/jats:italic>\n            -Membership to a problem kernel with\n            <jats:italic>O<\/jats:italic>\n            ((\n            <jats:italic>r<\/jats:italic>\n            + 1)\n            <jats:sup>\n              <jats:italic>r<\/jats:italic>\n            <\/jats:sup>\n            <jats:italic>\n              k\n              <jats:sup>r<\/jats:sup>\n            <\/jats:italic>\n            ) elements and the\n            <jats:italic>H<\/jats:italic>\n            -Packing with\n            <jats:italic>t<\/jats:italic>\n            -Membership and its edge version to problem kernels with\n            <jats:italic>O<\/jats:italic>\n            ((\n            <jats:italic>r<\/jats:italic>\n            + 1)\n            <jats:sup>\n              <jats:italic>r<\/jats:italic>\n            <\/jats:sup>\n            <jats:italic>\n              k\n              <jats:sup>r<\/jats:sup>\n            <\/jats:italic>\n            ) and\n            <jats:italic>O<\/jats:italic>\n            ((\n            <jats:italic>m<\/jats:italic>\n            + 1)\n            <jats:sup>\n              <jats:italic>m<\/jats:italic>\n            <\/jats:sup>\n            <jats:italic>\n              k\n              <jats:sup>m<\/jats:sup>\n            <\/jats:italic>\n            ) vertices, respectively. On the other hand, by generalizing [Fellows et al. 2008; Moser 2009], we achieve a kernel with\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>\n              r\n              <jats:sup>r<\/jats:sup>\n              k\n            <\/jats:italic>\n            <jats:sup>\n              <jats:italic>r<\/jats:italic>\n              \u2212\n              <jats:italic>t<\/jats:italic>\n              \u2212 1\n            <\/jats:sup>\n            ) elements for the\n            <jats:italic>r<\/jats:italic>\n            -Set Packing with\n            <jats:italic>t<\/jats:italic>\n            -Overlap and kernels with\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>\n              r\n              <jats:sup>r<\/jats:sup>\n              k\n            <\/jats:italic>\n            <jats:sup>\n              <jats:italic>r<\/jats:italic>\n              \u2212\n              <jats:italic>t<\/jats:italic>\n              \u2212 1\n            <\/jats:sup>\n            ) and\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>\n              m\n              <jats:sup>m<\/jats:sup>\n              k\n            <\/jats:italic>\n            <jats:sup>\n              <jats:italic>m<\/jats:italic>\n              \u2212\n              <jats:italic>t<\/jats:italic>\n              \u2212 1\n            <\/jats:sup>\n            ) vertices for the\n            <jats:italic>H<\/jats:italic>\n            -Packing with\n            <jats:italic>t<\/jats:italic>\n            -Overlap and its edge version, respectively. In all cases,\n            <jats:italic>k<\/jats:italic>\n            is the input parameter, while\n            <jats:italic>t<\/jats:italic>\n            ,\n            <jats:italic>r<\/jats:italic>\n            , and\n            <jats:italic>m<\/jats:italic>\n            are constants.\n          <\/jats:p>","DOI":"10.1145\/2786015","type":"journal-article","created":{"date-parts":[[2015,6,29]],"date-time":"2015-06-29T18:10:42Z","timestamp":1435601442000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps"],"prefix":"10.1145","volume":"7","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[{"name":"Universit\u00e4t Trier, Germany"}]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}]},{"given":"Jazm\u00edn","family":"Romero","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}]}],"member":"320","published-online":{"date-parts":[[2015,6,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.04.020"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM\u201901)","volume":"2","author":"Banerjee S.","unstructured":"S. Banerjee and S. Khuller . 2001. A clustering scheme for hierarchical control in multi-hop wireless networks . In Proceedings of the 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM\u201901) , Vol. 2 . IEEE Society Press, 1028--1037. S. Banerjee and S. Khuller. 2001. A clustering scheme for hierarchical control in multi-hop wireless networks. In Proceedings of the 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM\u201901), Vol. 2. IEEE Society Press, 1028--1037."},{"key":"e_1_2_1_3_1","volume-title":"Technical Report UU-CS-2008-030. Department of Information and Computer Sciences","author":"Bodlaender H. L.","year":"2008","unstructured":"H. L. Bodlaender , S. Thomass\u00e9 , and A. Yeo . 2008 . 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 . H. L. Bodlaender, S. Thomass\u00e9, and A. Yeo. 2008. 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."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00274-0"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29700-7_19"},{"volume-title":"Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201912)","author":"Dell H.","key":"e_1_2_1_6_1","unstructured":"H. Dell and D. Marx . 2012. Kernelization of packing problems . In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201912) , Y. Rabani (Ed.). SIAM, 68--81. H. Dell and D. Marx. 2012. Kernelization of packing problems. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201912), Y. Rabani (Ed.). SIAM, 68--81."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792229507"},{"key":"e_1_2_1_8_1","first-page":"329","article-title":"Dynamic dominating set and turbo-charging greedy heuristics. Tsinghua Sci","volume":"19","author":"Downey R. G.","year":"2014","unstructured":"R. G. Downey , J. Egan , M. R. Fellows , F. A. Rosamond , and P. Shaw . 2014 . Dynamic dominating set and turbo-charging greedy heuristics. Tsinghua Sci . Technol. 19 , 4 (2014), 329 -- 337 . R. G. Downey, J. Egan, M. R. Fellows, F. A. Rosamond, and P. Shaw. 2014. Dynamic dominating set and turbo-charging greedy heuristics. Tsinghua Sci. Technol. 19, 4 (2014), 329--337.","journal-title":"Technol."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.09.006"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30559-0_20"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9146-y"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9230-0"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"A. C. Giannopoulou B. M. P. Jansen D. Lokshtanov and S. Saurabh. 2014. Uniform Kernelization Complexity of Hitting Forbidding Minors. (2014). Unpublished see http:\/\/www.win.tue.nl\/&sim;bjansen\/publications.html.  A. C. Giannopoulou B. M. P. Jansen D. Lokshtanov and S. Saurabh. 2014. Uniform Kernelization Complexity of Hitting Forbidding Minors. (2014). Unpublished see http:\/\/www.win.tue.nl\/&sim;bjansen\/publications.html.","DOI":"10.1007\/978-3-662-47672-7_51"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095125"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210054"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"B. M. P. Jansen and D. Marx. 2014. Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms kernels and Turing kernels. CoRR abs\/1410.0855 (2014).   B. M. P. Jansen and D. Marx. 2014. Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms kernels and Turing kernels. CoRR abs\/1410.0855 (2014).","DOI":"10.1137\/1.9781611973730.42"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804353"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.12"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95891-8_37"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.009"},{"key":"e_1_2_1_22_1","volume-title":"the 8th International Workshop on Algorithms and Computation (LNCS), S. P. Pal and K. Sadakane (Eds.)","volume":"8344","author":"Romero J.","unstructured":"J. Romero and A. L\u00f3pez-Ortiz . 2014a. The G-packing with t-overlap problem . In the 8th International Workshop on Algorithms and Computation (LNCS), S. P. Pal and K. Sadakane (Eds.) , Vol. 8344 . Springer, Berlin, 114--124. J. Romero and A. L\u00f3pez-Ortiz. 2014a. The G-packing with t-overlap problem. In the 8th International Workshop on Algorithms and Computation (LNCS), S. P. Pal and K. Sadakane (Eds.), Vol. 8344. Springer, Berlin, 114--124."},{"key":"e_1_2_1_23_1","volume-title":"the 9th International Computer Science Symposium in Russia (LNCS), E. A. Hirsch, S. O. Kuznetsov, J.-\u00c9. Pin, and N. K. Vereshchagin (Eds.)","volume":"8476","author":"Romero J.","unstructured":"J. Romero and A. L\u00f3pez-Ortiz . 2014b. A parameterized algorithm for packing overlapping subgraphs . In the 9th International Computer Science Symposium in Russia (LNCS), E. A. Hirsch, S. O. Kuznetsov, J.-\u00c9. Pin, and N. K. Vereshchagin (Eds.) , Vol. 8476 . Springer, Berlin, 325--336. J. Romero and A. L\u00f3pez-Ortiz. 2014b. A parameterized algorithm for packing overlapping subgraphs. In the 9th International Computer Science Symposium in Russia (LNCS), E. A. Hirsch, S. O. Kuznetsov, J.-\u00c9. Pin, and N. K. Vereshchagin (Eds.), Vol. 8476. Springer, Berlin, 325--336."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90009-0"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.12.002"}],"container-title":["ACM Transactions on Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2786015","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2786015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:15Z","timestamp":1750225395000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2786015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,26]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7,9]]}},"alternative-id":["10.1145\/2786015"],"URL":"https:\/\/doi.org\/10.1145\/2786015","relation":{},"ISSN":["1942-3454","1942-3462"],"issn-type":[{"type":"print","value":"1942-3454"},{"type":"electronic","value":"1942-3462"}],"subject":[],"published":{"date-parts":[[2015,6,26]]},"assertion":[{"value":"2015-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}