{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article7611","name":"Robust Approximation of Temporal CSP","abstract":"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.\r\n\r\nFirstly, we give a qualitative characterization of robust approximability: Assuming the Unique Games Conjecture, we give a\r\nnecessary and sufficient condition on G under which CSP(G) admits\r\nrobust approximation. Secondly, we give a quantitative characterization of robust approximability: Assuming the Unique Games\r\nConjecture, we precisely characterize how f(e) depends on e for each\r\nG. We show that our robust approximation algorithms can be run in\r\nalmost linear time.","keywords":["constraint satisfaction","maximum satisfiability","approximation algorithm","hardness of approximation","infinite domain"],"author":[{"@type":"Person","name":"Tamaki, Suguru","givenName":"Suguru","familyName":"Tamaki"},{"@type":"Person","name":"Yoshida, Yuichi","givenName":"Yuichi","familyName":"Yoshida"}],"position":30,"pageStart":419,"pageEnd":432,"dateCreated":"2014-09-04","datePublished":"2014-09-04","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Tamaki, Suguru","givenName":"Suguru","familyName":"Tamaki"},{"@type":"Person","name":"Yoshida, Yuichi","givenName":"Yuichi","familyName":"Yoshida"}],"copyrightYear":"2014","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2014.419","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6231","volumeNumber":28,"name":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2014)","dateCreated":"2014-09-04","datePublished":"2014-09-04","editor":[{"@type":"Person","name":"Jansen, Klaus","givenName":"Klaus","familyName":"Jansen"},{"@type":"Person","name":"Rolim, Jos\u00e9","givenName":"Jos\u00e9","familyName":"Rolim"},{"@type":"Person","name":"Devanur, Nikhil R.","givenName":"Nikhil R.","familyName":"Devanur"},{"@type":"Person","name":"Moore, Cristopher","givenName":"Cristopher","familyName":"Moore"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article7611","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6231"}}}