An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
From MaRDI portal
Publication:2430016
DOI10.1016/j.tcs.2010.12.048zbMath1213.68721MaRDI QIDQ2430016
Qilong Feng, Jianxin Wang, Jian'er Chen
Publication date: 5 April 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.048
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68W20: Randomized algorithms