Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant

Venkatesan Guruswami, Johan HÃ¥stad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar. Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant. Electronic Colloquium on Computational Complexity (ECCC), 18:27, 2011. [doi]

Abstract

Abstract is missing.