Finding a minimum feedback arc set in reducible flow graphs
Journal of Algorithms
Tight bounds for the maximum acyclic subgraph problem
Journal of Algorithms
A Geometric Approach to Betweenness
SIAM Journal on Discrete Mathematics
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A new way of using semidefinite programming with applications to linear equations mod p
Journal of Algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
On the Advantage over Random for Maximum Acyclic Subgraph
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximation Resistant Predicates from Pairwise Independence
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Every 2-csp Allows Nontrivial Approximation
Computational Complexity
Every Permutation CSP of arity 3 is Approximation Resistant
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
On the Approximation Resistance of a Random Predicate
Computational Complexity
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
Randomly Supported Independence and Resistance
SIAM Journal on Computing
Bypassing UGC from some optimal geometric inapproximability results
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parameterized complexity of maxsat above average
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
Parameterized complexity of MaxSat Above Average
Theoretical Computer Science
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
Hi-index | 0.00 |
We prove that, assuming the Unique Games conjecture (UGC), every problem in the class of ordering constraint satisfaction problems (OCSPs) where each constraint has constant arity is approximation resistant. In other words, we show that if $\rho$ is the expected fraction of constraints satisfied by a random ordering, then obtaining a $\rho'$ approximation for any $\rho'\rho$ is UG-hard. For the simplest OCSP, the Maximum Acyclic Subgraph (MAS) problem, this implies that obtaining a $\rho$-approximation for any constant $\rho1/2$ is UG-hard. Specifically, for every constant $\varepsilon0$ the following holds: given a directed graph $G$ that has an acyclic subgraph consisting of a fraction $(1-\varepsilon)$ of its edges, it is UG-hard to find one with more than $(1/2+\varepsilon)$ of its edges. Note that it is trivial to find an acyclic subgraph with $1/2$ the edges by taking either the forward or backward edges in an arbitrary ordering of the vertices of $G$. The MAS problem has been well studied, and beating the random ordering for MAS has been a basic open problem. An OCSP of arity $k$ is specified by a subset $\Pi\subseteq S_k$ of permutations on $\{1,2,\dots,k\}$. An instance of such an OCSP is a set $V$ and a collection of constraints, each of which is an ordered $k$-tuple of $V$. The objective is to find a global linear ordering of $V$ while maximizing the number of constraints ordered as in $\Pi$. A random ordering of $V$ is expected to satisfy a $\rho=\frac{|\Pi|}{k!}$ fraction. We show that, for any fixed $k$, it is hard to obtain a $\rho'$-approximation for $\Pi$-OCSP for any $\rho'\rho$. The result is in fact stronger: we show that for every $\Lambda\subseteq\Pi\subseteq S_k$, and an arbitrarily small $\varepsilon$, it is hard to distinguish instances where a $(1-\varepsilon)$ fraction of the constraints can be ordered according to $\Lambda$ from instances where at most a $(\rho+\varepsilon)$ fraction can be ordered as in $\Pi$. A special case of our result is that the Betweenness problem is hard to approximate beyond a factor $1/3$. The results naturally generalize to OCSPs which assign a payoff to the different permutations. Finally, our results imply (unconditionally) that a simple semidefinite relaxation for MAS does not suffice to obtain a better approximation.