Abstract
Packing problems form an important class of NP-hard problems. For the weighted 3-Set Packing problem, we provide further theoretical study on the problem and present a deterministic algorithm of time O*(10. 63k ). Based on the randomized divide-and-conquer method, the above result can be further reduced to O*(7.563k ), which significantly improves the previous best result O*(12.8 3k ). © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Wang, J., & Feng, Q. (2008). Improved parameterized algorithms for weighted 3-set packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 130–139). https://doi.org/10.1007/978-3-540-69733-6_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
