Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Revision(s):

Revision #1 to TR10-106 | 29th October 2010 04:04

Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP

Revision #1
Authors: Yuichi Yoshida
Accepted on: 29th October 2010 04:04
Keywords:

Abstract:

Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple semidefinite programming and a rounding scheme for it.
In this paper, we show that similar results hold for constant-time approximation algorithms in the bounded-degree model. Specifically, we present the followings: (i) For every CSP, we construct an oracle that serves an access, in constant time, to a nearly optimal solution to a basic LP relaxation of the CSP. (ii) Using the oracle, we give a constant-time rounding scheme that achieves an approximation ratio coincident with the integrality gap of the basic LP. (iii) Finally, we give a generic conversion from integrality gaps of basic LPs to hardness results. All of those results are \textit{unconditional}. Therefore, for every bounded-degree CSP, we give the best constant-time approximation algorithm among all.
A CSP instance is called $\epsilon$-far from satisfiability if we must remove at least an $\epsilon$-fraction of constraints to make it satisfiable. A CSP is called testable if there is a constant-time algorithm that distinguishes satisfiable instances from $\epsilon$-far instances with probability at least $2/3$. Using the results above, we also derive, under a technical assumption, an equivalent condition under which a CSP is testable in the bounded-degree model.

Paper:

TR10-106 | 17th June 2010 02:07

Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP

TR10-106
Authors: Yuichi Yoshida
Publication: 2nd July 2010 14:00
Keywords:

Abstract:

Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple semidefinite programming and a rounding scheme for it.
In this paper, we show that a similar result holds for constant-time approximation algorithms in the bounded-degree model.
Specifically, we present the followings: (i) For every CSP, we construct an oracle that serves an access, in constant time, to a nearly optimal solution of a basic LP relaxation of the CSP. (ii) Using the oracle, we present a constant-time rounding scheme that achieves an approximation ratio oincident with the integrality gap of the basic LP.
(iii) We give a generic conversion from integrality gaps of basic LPs to hardness results.
All of those results are unconditional.'' Therefore, for every bounded-degree CSP, we give the best constant-time approximation algorithm among all.

ISSN 1433-8092 | Imprint