An efficient parameterized algorithm for m-set packing
From MaRDI portal
Recommendations
Cited in
(21)- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- Parameterized algorithms for weighted matching and packing problems
- Parametric packing of selfish items and the subset sum algorithm
- Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case
- An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
- A fixed-parameter-tractable algorithm for set packing
- A faster parameterized algorithm for set packing
- Improved deterministic algorithms for weighted matching and packing problems
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem
- An improved kernelization algorithm for \(r\)-set packing
- Confronting intractability via parameters
- Narrow sieves for parameterized paths and packings
- Faster fixed-parameter tractable algorithms for matching and packing problems
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- A Parameterized Perspective on Packing Paths of Length Two
- Parameterized complexity of path set packing
- Parameterized complexity of control and bribery for \(d\)-approval elections
- Parameterized complexity of control and bribery for \(d\)-approval elections
- A dynamic programming algorithm for tree-like weighted set packing problem
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
This page was built for publication: An efficient parameterized algorithm for m-set packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819697)
