Pages that link to "Item:Q4819697"
From MaRDI portal
The following pages link to An efficient parameterized algorithm for m-set packing (Q4819697):
Displayed 17 items.
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
- An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
- Parameterized algorithms for weighted matching and packing problems (Q955335) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- A faster parameterized algorithm for set packing (Q1041711) (← links)
- Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (Q2430016) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- A dynamic programming algorithm for tree-like weighted set packing problem (Q2638196) (← links)
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem (Q2656742) (← links)
- Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
- A Parameterized Perspective on Packing Paths of Length Two (Q5505643) (← links)
- Parameterized complexity of path set packing (Q6091171) (← links)