Abstract
Given a universe U := U_1 + .... + U_r and a r-uniform family F which is a subset of U_1 x .... x U_r, the r-dimensional matching problem asks if F admits a collection of k mutually disjoint sets. The special case when r=3 is the classic 3-Dimensional Matching problem. Recently, several improvements have been suggested for these (and closely related) problems in the setting of randomized parameterized algorithms. Also, many approaches have evolved for deterministic parameterized algorithms. For instance, for the 3-Dimensional Matching problem, a combination of color coding and iterative expansion yields a running time of O^*(2.80^{(3k)}), and for the r-dimensional matching problem, a recently developed derandomization for known algebraic techniques leads to a running time of O^*(5.44^{(r-1)k}). In this work, we employ techniques based on dynamic programming and representative families, leading to a deterministic algorithm with running time O^*(2.85^{(r-1)k}) for the r-Dimensional Matching problem. Further, we incorporate the principles of iterative expansion used in the literature [TALG 2012] to obtain a better algorithm for 3D-matching, with a running time of O^*(2.003^{(3k)}). Apart from the significantly improved running times, we believe that these algorithms demonstrate an interesting application of representative families in conjunction with more traditional techniques.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.