Optimally repurposing existing algorithms to obtain exponential-time approximations

DOI10.1137/1.9781611977912.13MaRDI QIDQ6645358zbMATH OpenFDO

Authors Barış Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.13

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Approximate min-sum subset convolution
• Solving directed multiway cut faster than 2ⁿ
• Sampling with a black box: faster parameterized approximation algorithms for vertex deletion 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)