Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets
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.
3-Dimensional Matching
Fixed-Parameter Algorithms
Iterative Expansion
237-248
Regular Paper
Prachi
Goyal
Prachi Goyal
Neeldhara
Misra
Neeldhara Misra
Fahad
Panolan
Fahad Panolan
10.4230/LIPIcs.FSTTCS.2013.237
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode