Pages that link to "Item:Q1882527"
From MaRDI portal
The following pages link to Using nondeterminism to design efficient deterministic algorithms (Q1882527):
Displayed 13 items.
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← 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)
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (Q3503572) (← links)
- (Q5111282) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)