Suguru Tamaki   Yuichi Yoshida   
The 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Leibniz International Proceedings in Informatics, LIPIcs 28 419-432 2014年9月 [査読有り]
A temporal constraint language Γ is a set of relations with first-order definitions in (Q
<
). Let CSP(Γ) denote the set of constraint satisfaction problem instances with relations from Γ. CSP(Γ) admits robust approximation if, for any ∈≥ 0, giv...