An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (Q2430016)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem |
scientific article |
Statements
An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (English)
0 references
5 April 2011
0 references
3-set packing
0 references
divide and conquer
0 references
(\(n,k\))-universal set
0 references
