Complexity and Approximability of Parameterized MAX-CSPs
From MaRDI portal
Publication:5363783
DOI10.4230/LIPIcs.IPEC.2015.294zbMath1378.68071arXiv1511.05546OpenAlexW4391525139MaRDI QIDQ5363783
Valia Mitsou, Holger Dell, Eun Jung Kim, Michael Lampis, Tobias Mömke
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1511.05546
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items