Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse

DOI10.4230/LIPIcs.STACS.2016.37zbMath1388.68307arXiv1507.04391OpenAlexW2962705766MaRDI QIDQ4601889

Vangelis Th. Paschos, Dimitris Fotakis, Michael Lampis

Publication date: 24 January 2018

Full work available at URL: https://arxiv.org/abs/1507.04391

zbMATH Keywords

samplingrandomized roundingpolynomial and subexponential approximation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items (2)

In)approximability of Maximum Minimal FVS ⋮ (In)approximability of maximum minimal FVS

This page was built for publication: Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse