Faster Deterministic Algorithms for Packing, Matching and $t$-Dominating Set Problems

Shenshi Chen, Zhixiang Chen

In this paper, we devise three deterministic algorithms for solving the $m$-set $k$-packing, $m$-dimensional $k$-matching, and $t$-dominating set problems in time $O^{\ast }(5.44^{mk})$,…