{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T06:54:49Z","timestamp":1790319289446,"version":"4.1.0"},"reference-count":33,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>In this work, we study the well-known $r$-Dimensional $k$-Matching ($(r,k)$-DM), and $r$-Set $k$-Packing ($(r,k)$-SP) problems. Given a universe $U := U_1 \\uplus \\cdots \\uplus U_r$ and an $r$-uniform family $\\mathcal{F} \\subseteq U_1 \\times \\cdots \\times U_r$, the $(r,k)$-DM problem asks if $\\mathcal{F}$ admits a collection of $k$ mutually disjoint sets. Given a universe $U$ and an $r$-uniform family $\\mathcal{F}\\subseteq 2^U$, the $(r,k)$-SP problem asks if $\\mathcal{F}$ admits a collection of $k$ mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time $\\mathcal{O} (2.851^{(r-1)k}\\cdot|\\mathcal{F}|\\cdot n\\log^2 n\\cdot \\log W)$ for the weighted version of $(r,k)$-DM, where $W$ is the maximum weight in the input, and a deterministic algorithm with running time $\\mathcal{O}(2.851^{(r-0.5501)k}\\cdot|\\mathcal{F}|\\cdot n\\log^2 n\\cdot \\log W)$ for the weighted version of $(r,k)$-SP. Thus, we significantly improve the previous best known deterministic running times for $(r,k)$-DM and $(r,k)$-SP and the previous best known running times for their weighted versions. We rely on structural properties of $(r,k)$-DM and $(r,k)$-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for $(3,k)$-DM, running in time $\\mathcal{O}(2.004^{3k}\\cdot|\\mathcal{F}| \\cdot n\\log^2 n)$. We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size $\\mathcal{O}(e^rr(k-1)^r\\log W)$ for the weighted versions of $(r,k)$-DM and $(r,k)$-SP, improving the previous best known kernels of size $\\mathcal{O}(r!r(k-1)^r\\log W)$ for these problems.<\/jats:p>","DOI":"10.1137\/140981290","type":"journal-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T12:59:53Z","timestamp":1444136393000},"page":"1815-1836","source":"Crossref","is-referenced-by-count":11,"title":["Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets"],"prefix":"10.1137","volume":"29","author":[{"given":"Prachi","family":"Goyal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meirav","family":"Zehavi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,10,6]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"atypb2","unstructured":"A. Bjo\u0308rklund, T. Husfeldt, P. Kaski, and M. Koivisto,\n                      Narrow sieves for parameterized paths and packings\n                      , CoRR, abs\/1007.1161, 2010."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01904851"},{"key":"atypb4","first-page":"123","volume":"93","author":"Chandran L. S.","year":"2005","journal-title":"Inform. Process. Lett."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.042"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1096-z"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/080716475"},{"key":"atypb8","first-page":"8","author":"Chen J.","year":"2012","journal-title":"ACM Trans. Algorithms"},{"key":"atypb9","unstructured":"S. Chen and Z. Chen,\n                      Faster deterministic algorithms for packing, matching and t-dominating set problems\n                      , CoRR, abs\/1306.3602, 2013."},{"key":"atypb10","first-page":"68","author":"Dell H.","year":"2012","journal-title":"Proceedings of SODA"},{"key":"atypb11","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows,\n                      Parameterized Complexity\n                      , Springer, New York, 1999.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows,\n                      Fundamentals of Parameterized Complexity\n                      , Springer, New York, 2013.","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"atypb13","unstructured":"R. G. Downey, M. R. Fellows, and M. Koblitz,\n                      Techniques for exponential parameterized reductions in vertex set problems\n                      , (Unpublished, reported in DowneyFellows1999, section 8.3)."},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9146-y"},{"key":"atypb15","unstructured":"J. Flum and M. Grohe,\n                      Parameterized Complexity Theory\n                      , Texts Theoret. Comput. Sci. EATCS Ser., Springer, New York, 2006."},{"key":"atypb16","first-page":"443","author":"Fomin F. V.","year":"2014","journal-title":"Proceedings of ESA"},{"key":"atypb17","first-page":"142","author":"Fomin F. V.","year":"2014","journal-title":"Proceedings of SODA"},{"key":"atypb18","unstructured":"M. R. Garey and D. S. Johnson,\n                      Computers and Intractability\n                      , W. H. Freeman, San Francisco, 1979."},{"key":"atypb19","first-page":"237","author":"Goyal P.","year":"2013","journal-title":"Proceedings of FSTTCS"},{"key":"atypb20","first-page":"104","author":"Hermelin D.","year":"2012","journal-title":"Proceedings of SODA"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.12.005"},{"key":"atypb22","first-page":"575","author":"Koutis I.","year":"2008","journal-title":"New York"},{"key":"atypb23","first-page":"653","author":"Koutis I.","year":"2009","journal-title":"New York"},{"key":"atypb24","first-page":"575","author":"Liu Y.","year":"2007","journal-title":"Proceedings of TAMC"},{"key":"atypb25","first-page":"84","author":"Liu Y.","year":"2006","journal-title":"New York"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.008"},{"key":"atypb27","first-page":"239","volume":"25","author":"Monien B.","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"atypb28","doi-asserted-by":"crossref","unstructured":"R. Niedermeier,\n                      Invitation to Fixed-Parameter Algorithms\n                      , Oxford University Press, Oxford, 2006.","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"atypb29","first-page":"589","author":"Pinter R. Y.","year":"2014","journal-title":"Proceedings of MFCS"},{"key":"atypb30","first-page":"786","author":"Shachnai H.","year":"2014","journal-title":"Proceedings of ESA"},{"key":"atypb31","first-page":"130","author":"Wang J.","year":"2008","journal-title":"Proceedings of COCOON"},{"key":"atypb32","first-page":"82","author":"Wang J.","year":"2008","journal-title":"Proceedings of TAMC"},{"key":"atypb33","first-page":"887","author":"Williams V. V.","year":"2012","journal-title":"Proceedings of SODA"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140981290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:46:52Z","timestamp":1787320012000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140981290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/140981290"],"URL":"https:\/\/doi.org\/10.1137\/140981290","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}