Faster exponential-time approximation algorithms using approximate monotone local search

DOI10.4230/LIPICS.ESA.2022.50MaRDI QIDQ6969632zbMATH OpenFDO

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

Publication date 19 June 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

exponential approximationsparameterized approximationsmonotone local search

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Faster exponential-time approximation algorithms using approximate monotone local search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969632)