Beating the random ordering is hard: Every ordering csp is approximation resistant

SIAM Journal on Computing

Volumn 40, Issue 3, 2011, Pages 878-914

  Guruswami, Venkatesan ^a   H̊Astad, Johan ^b   Manokaran, Rajsekar ^c   Raghavendra, Prasad ^d   Charikar, Moses ^c  

^a Carnegie Mellon University   (United States)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c Princeton University   (United States)

^d Georgia Institute of Technology   (United States)

Author keywords

Feedback arc set; Hardness of approximation; Integrality gaps; Maximum acyclic subgraph; Unique games conjecture

Indexed keywords

ARBITRARY ORDERING; BETWEENNESS; DIRECTED GRAPHS; HARDNESS OF APPROXIMATION; INTEGRALITY GAPS; IS APPROXIMATION; LINEAR ORDERINGS; OPEN PROBLEMS; ORDERING CONSTRAINTS; SEMIDEFINITE RELAXATION; SUBGRAPHS; UNIQUE GAMES CONJECTURE;

EID: 79960378967     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090756144     Document Type: Conference Paper

References (38)

1. G. Andersson, L. Engebretsen, and J. Håstad, A new way of using semidefinite programming with applications to linear equations mod p, J. Algorithms, 39 (2001), pp. 162-204. (Pubitemid 33668348)
2. P. Austrin, Towards sharp inapproximability for any 2-CSP, SIAM J. Comput., 39 (2010), pp. 2430-2463.
3. P. Austrin and J. Håstad, Randomly supported independence and resistance, SIAM J. Comput., 40 (2011), pp. 1-27.
4. P. Austrin and E. Mossel, Approximation resistant predicates from pairwise independence, Comput. Complexity, 18 (2009), pp. 249-271.
5. B. Berger and P. W. Shor, Tight bounds for the maximum acyclic subgraph problem, J. Algorithms, 25 (1997), pp. 1-18. (Pubitemid 127451248)
6. M. Charikar, V. Guruswami, and R. Manokaran, Every permutation CSP of arity 3 is approximation resistant, in Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009, pp. 62-73.
7. M. Charikar, K. Makarychev, and Y. Makarychev, On the advantage over random for maximum acyclic subgraph, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007, pp. 625-633.
8. M. Charikar, Y. Makarychev, and K. Makarychev, Near-optimal algorithms for unique games, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 205-214. (Pubitemid 44306554)
9. B. Chor and M. Sudan, A geometric approach to betweenness, SIAM J. Discrete Math., 11 (1998), pp. 511-523. (Pubitemid 128620586)
10. L. Engebretsen and V. Guruswami, Is constraint satisfaction over two variables always easy?, Random Structures Algorithms, 25 (2004), pp. 150-178. (Pubitemid 40031414)
11. G. Even, J. Naor, B. Schieber, and M. Sudan, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20 (1998), pp. 151-174. (Pubitemid 128663382)
12. U. Feige and M. X. Goemans, Approximating the value of two proper proof systems, with applications to MAX-2SAT and MAX-DICUT, in Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995, pp. 182-189.
13. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115-1145.
14. V. Guruswami, R. Manokaran, and P. Raghavendra, Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph, in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 573-582.
15. V. Guruswami and Y. Zhou, Approximating Bounded Occurrence Ordering CSPs, manuscript, 2010.
16. G. Hast, Beating a Random Assignment, Ph.D. thesis, Royal Institute of Technology, Stockholm, Sweden, 2005.
17. J. Håstad, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
18. J. Håstad, Every 2-CSP allows nontrivial approximation, Comput. Complexity, 17 (2008), pp. 549-566.
19. J. Håstad, On the approximation resistance of a random predicate, Comput. Complexity, 18 (2009), pp. 413-434.
20. M. Isaksson and E. Mossel, Maximally stable Gaussian partitions with discrete applications, Israel J. Math., to appear.
21. A. Karazanov, On the minimal number of arcs of a digraph meeting all its directed cutsets, Graph Theory Newsletters, 8 (1979).
22. R. M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, Plenum, New York, 1972, pp. 85-103.
23. S. Khot, On the power of unique 2-prover 1-round games, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 767-775. (Pubitemid 35009440)
24. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell, Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?, SIAM J. Comput., 37 (2007), pp. 319-357. (Pubitemid 351321999)
25. S. Khot and O. Regev, Vertex cover might be hard to approximate to within 2-epsilon, J. Comput. System Sci., 74 (2008), pp. 335-349.
26. S. Khot and N. K. Vishnoi, The Unique Games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l1, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 53-62. (Pubitemid 44375719)
27. C. Lucchesi and D. H. Younger, A minimax theorem for directed graphs, J. London Math. Soc. (2), 17 (1978), pp. 369-374.
28. Y. Makarychev, Simple Linear Time Approximation Algorithm for Betweenness, Microsoft Research Technical report MSR-TR-2009-74, 2009.
29. R. Manokaran, J. S. Naor, P. Raghavendra, and R. Schwartz, SDP gaps and UGC hardness for multiway cut, 0-extension and metric labelling, in Proceedings of the 40th ACM Symposium on Theory of Computing, 2008, pp. 11-20.
30. E. Mossel, Gaussian bounds for noise correlation of functions and tight analysis of long codes, in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 156-165.
31. E. Mossel, R. O'Donnell, and K. Oleszkiewicz, Noise stability of functions with low influences: Invariance and optimality, Ann. of Math. (2), 171 (2010), pp. 295-341.
32. A. Newman, Approximating the Maximum Acyclic Subgraph, Master's thesis, MIT, Cambridge, MA, 2000.
33. A. Newman, Cuts and orderings: On semidefinite relaxations for the linear ordering problem, in Proceedings of APPROX-RANDOM, 2004, pp. 195-206.
34. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
35. P. Raghavendra, Optimal algorithms and inapproximability results for every CSP?, in Proceedings of the 40th ACM Symposium on Theory of Computing, 2008, pp. 245-254.
36. V. Ramachandran, Finding a minimum feedback arc set in reducible flow graphs, J. Algorithms, 9 (1988), pp. 299-313.
37. P. Seymour, Packing directed circuits fractionally, Combinatorica, 15 (1995), pp. 281-288.
38. U. Zwick, Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint, in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 201-210.