An efficient parameterized algorithm for m-set packing
From MaRDI portal
Publication:4819697
DOI10.1016/j.jalgor.2003.07.001zbMath1068.68171OpenAlexW2004420077MaRDI QIDQ4819697
Chuanlin Zhang, Jian'er Chen, Wei-Jia Jia
Publication date: 4 October 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2003.07.001
Related Items
A dynamic programming algorithm for tree-like weighted set packing problem ⋮ Narrow sieves for parameterized paths and packings ⋮ An evolutionary algorithm based hyper-heuristic framework for the set packing problem ⋮ The control complexity of \(r\)-Approval: from the single-peaked case to the general case ⋮ Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization ⋮ Parameterized complexity of path set packing ⋮ An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem ⋮ Confronting intractability via parameters ⋮ Parameterized algorithms for weighted matching and packing problems ⋮ Faster fixed-parameter tractable algorithms for matching and packing problems ⋮ Improved deterministic algorithms for weighted matching and packing problems ⋮ An improved kernelization algorithm for \(r\)-set packing ⋮ A faster parameterized algorithm for set packing ⋮ A Parameterized Perspective on Packing Paths of Length Two ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness ⋮ Parameterized Complexity of Control and Bribery for d-Approval Elections ⋮ Parameterized complexity of control and bribery for \(d\)-approval elections
