Optimally repurposing existing algorithms to obtain exponential-time approximations
From MaRDI portal
Cited in
(5)- Approximate min-sum subset convolution
- Solving directed multiway cut faster than 2ⁿ
- Exponential-time approximation (schemes) for vertex-ordering problems
- Sampling with a black box: faster parameterized approximation algorithms for vertex deletion problems
- Approximate monotone local search for weighted problems
This page was built for publication: Optimally repurposing existing algorithms to obtain exponential-time approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645358)