Robust Approximation of Temporal CSP
From MaRDI portal
Publication:2969636
DOI10.4230/LIPIcs.APPROX-RANDOM.2014.419zbMath1359.68144OpenAlexW2249596971MaRDI QIDQ2969636
Publication date: 22 March 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4713/pdf/30.pdf
approximation algorithmconstraint satisfactionmaximum satisfiabilityhardness of approximationinfinite domain
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)