An O*(3.523k) Parameterized Algorithm for 3-Set Packing

Download PDF
Open Webpage

Jianxin Wang, Qilong Feng

Published: 2008, Last Modified: 01 Oct 2024TAMC 2008EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Packing problems have formed an important class of NP-hard problems. In this paper, we provide further theoretical study on the structure of the problems, and design improved algorithm for packing problems. For the 3-Set Packing problem, we present a deterministic algorithm of time O *(3.523k), which significantly improves the previous best algorithm of time O *(4.613k).