The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs
[article]

2013
*
arXiv
*
pre-print

We prove that the Bounded Occurrence Ordering k-CSP Problem is not approximation resistant. We give a very simple local search algorithm that always performs better than the random assignment algorithm. Specifically, the expected value of the solution returned by the algorithm is at least Alg > Avg + a(B,k) (Opt - Avg), where "Opt" is the value of the optimal solution; "Avg" is the expected value of the random solution; and a(B,k)=Omega_k(B^-(k+O(1)) is a parameter depending only on "k" (the

arXiv:1210.1890v2
fatcat:if5gfbunwjemrowa76qwljcqse