eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2014-09-04
419
432
10.4230/LIPIcs.APPROX-RANDOM.2014.419
article
Robust Approximation of Temporal CSP
Tamaki, Suguru
Yoshida, Yuichi
A temporal constraint language G is a set of relations with first-order definitions in (Q; <). Let CSP(G) denote the set of constraint satisfaction problem instances with relations from G. CSP(G) admits robust approximation if, for any e >= 0, given a (1-e)-satisfiable instance of CSP(G), we can compute an assignment that satisfies at least a (1-f(e))-fraction of constraints in polynomial time. Here, f(e) is some function satisfying f(0)=0 and f(e) goes 0 as e goes 0.
Firstly, we give a qualitative characterization of robust approximability: Assuming the Unique Games Conjecture, we give a
necessary and sufficient condition on G under which CSP(G) admits
robust approximation. Secondly, we give a quantitative characterization of robust approximability: Assuming the Unique Games
Conjecture, we precisely characterize how f(e) depends on e for each
G. We show that our robust approximation algorithms can be run in
almost linear time.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol028-approx-random2014/LIPIcs.APPROX-RANDOM.2014.419/LIPIcs.APPROX-RANDOM.2014.419.pdf
constraint satisfaction
maximum satisfiability
approximation algorithm
hardness of approximation
infinite domain