Skew bisubmodularity and valued CSPs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 1296-1305

  Huber, Anna ^a   Krokhin, Andrei ^a   Powell, Robert ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; RATIONAL FUNCTIONS;

BISUBMODULARITY; CONSTRAINT SATISFACTION; DICHOTOMY THEOREM; FINITE DOMAINS; MAX-CUT PROBLEM; SUBMODULAR FUNCTIONS; SUBMODULARITY; VALUED CONSTRAINT SATISFACTION PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84876066596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.94     Document Type: Conference Paper

References (43)

1. K. Ando, S. Fujishige, and T. Naitoh. A characterization of bisubmodular functions. Discrete Mathematics, 148:299-303, 1996.
2. L. Barto and M. Kozik. Absorbing subalgebras, cyclic terms and the constraint satisfaction problem. Logical Methods in Computer Science, 8(1):1-26, 2012.
3. L. Barto and M. Kozik. Robust satisfiability of constraint satisfaction problems. In Proceedings of STOC' 12, pages 931-940, 2012.
4. A. Bulatov. A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM, 53(1):66-120, 2006.
5. A. Bulatov. Complexity of conservative constraint satisfaction problems. ACM Transactions on Computational Logic, 12(4):Article 24, 2011.
6. A. Bulatov, P. Jeavons, and A. Krokhin. Classifying complexity of constraints using finite algebras. SIAM Journal on Computing, 34(3):720-742, 2005.
7. D. Cohen, M. Cooper, P. Creed, P. Jeavons, and S. Živný. An algebraic theory of complexity for discrete optimisation. CoRR, Technical Report abs/1207.6692, 2012.
8. D. Cohen, M. Cooper, and P. Jeavons. An algebraic characterisation of complexity for valued constraints. In Proceedings of CP'06, volume 4204 of LNCS, pages 107-121, 2006.
9. D. Cohen, M. Cooper, and P. Jeavons. Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science, 401(1):36-51, 2008.
10. D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin. Supermodular functions and the complexity of Max CSP. Discrete Applied Mathematics, 149(1-3):53-72, 2005.
11. D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin. The complexity of soft constraint satisfaction. Artificial Intelligence, 170(11):983-1016, 2006.
12. D. Cohen and P. Jeavons. The complexity of constraint languages. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 8. Elsevier, 2006.
13. Y. Crama and P.L. Hammer. Boolean Functions - Theory, Algorithms and Applications. Cambridge University Press, 2011.
14. N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM. 2001.
15. N. Creignou, Ph.G. Kolaitis, and H. Vollmer, editors. Complexity of Constraints, volume 5250 of LNCS. Springer, 2008.
16. T. Feder and M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. Comput, 28:57-104, 1998.
17. U. Feige, V. Mirrokni, and J. Vondrák. Maximizing non-monotone submodular functions. SIAM J. Comput, 40:1133-1153, 2011.
18. S. Fujishige. Submodular Functions and Optimization. Elsevier, 2nd edition, 2005.
19. G. Gottlob, L. Leone, and F. Scarcello. Tractable optimization problems through hypergraph-based structural restrictions. In Proceedings of ICALP'09, pages 16-30, 2009.
20. A. Huber and V. Kolmogorov. Towards minimizing k-submodular functions. In Proceedings of ISCO'12, pages 451-462, 2012.
21. S. Iwata and J. Orlin. A simple combinatorial algorithm for submodular function minimization. In Proceedings of SODA '09, pages 1230-1237, 2009.
22. P. Jonsson, M. Klasson, and A. Krokhin. The approximability of three-valued Max CSP. SIAM J. Comput., 35(6): 1329-1349, 2006.
23. P. Jonsson, F. Kuivinen, and J. Thapper. Min CSP on four elements: Moving beyond submodularity. In Proceedings of CP'11, pages 438-453, 2011.
24. P. Jonsson and G. Nordh. Introduction to the Maximum Solution problem. In Complexity of Constraints, volume 5250 of LNCS, pages 255-282. 2008.
25. S. Khot. On the unique games conjecture. In Proceedings of CCC'10, pages 99-121, 2010.
26. # -convex and bisubmodular functions. In Proceedings of MFCS'11, pages 400-411, 2011.
27. V. Kolmogorov and S. Živný. The complexity of conservative valued CSPs. In Proceedings of SODA '12, pages 750-759, 2012.
28. V. Kolmogorov. The power of linear programming for valued CSPs: A constructive characterization. CoRR, Technical Report abs/1207.7213, 2012.
29. A. Krokhin and B. Larose. Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction. SIAM J. Discr. Math., 22(1):312-328, 2008.
30. F. Kuivinen. On the complexity of submodular function minimisation on diamonds. Discrete Optimization, 8(3):459-477, 2011.
31. G. Kun, R. O'Donnell, S. Tamaki, Y. Yoshida, an Y. Zhou. Linear programming, width-1 CSPs, and robust satisfaction. In Proceedings of TTCS'12, pages 484-495, 2012.
32. L. Lovász. Submodular functions and convexity. In A. Bachern, M. Grötschel, and B. Korte, editors, Mathematical Programming: The State of the Art, pages 235-257. Springer, 1983.
33. D. Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In Proceedings of STOC' 10, pages 735-744, 2010.
34. S.T. McCormick. Submodular function minimization. In K. Aardal, G. Nemhauser, and R. Weismantel, editors, Handbook on Discrete Optimization, chapter 7, pages 321-391. Elsevier, 2006.
35. S.T. McCormick and S. Fujishige. Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Mathematical Programming, Ser.A, 122:87-120, 2010.
36. L. Qi. Directed submodularity, ditroids and directed submodular flows. Mathematical Programming, 42(1-3):579-599, 1988.
37. P. Raghavendra. Approximating NP-hard problems: Efficient algorithms and their limits. PhD thesis, University of Washington, 2009.
38. T.J. Schaefer. The complexity of satisfiability problems. In STOC'78, pages 216-226, 1978.
39. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003.
40. R. Takhanov. A dichotomy theorem for the general minimum cost homomorphism problem. In Proceedings of STACS'10, pages 657-668, 2010.
41. J. Thapper and S. Živný. The power of linear programming for valued CSPs. In Proceedings of FOCS'12, 2012. To appear; available at arXiv:1204.1079v2.
42. D. Topkis. Minimizing a submodular function on a lattice. Operations Res., 26(2):305-321, 1978.
43. M.J. Wainwright and M.I. Jordan. Graphical models, exponential families, and variational inferences. Foundations and Trends in Machine Learning, 1(1-2):1-305, 2008.