The power of linear programming for valued CSPs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 669-678

  Thapper, Johan ^a   Živný, Stanislav ^b,c  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

bisubmodularity; fractional homomorphisms; fractional polymorphisms; linear programming; submodularity; valued constraint satisfaction

Indexed keywords

BISUBMODULARITY; CONSTRAINT LANGUAGE; CONSTRAINT SATISFACTION PROBLEMS; FINITE DOMAINS; FRACTIONAL HOMOMORPHISMS; LINEAR PROGRAMMING RELAXATION; MAXIMUM CONSTRAINT SATISFACTION PROBLEMS; SUBMODULARITY; VALUED CONSTRAINT SATISFACTION; VALUED CONSTRAINT SATISFACTION PROBLEMS;

COMPUTER SCIENCE; COST FUNCTIONS; FORESTRY; LINEAR PROGRAMMING;

CONSTRAINT THEORY;

COMPUTATION; COSTS; FORESTRY; MATHEMATICAL ANALYSIS;

EID: 84871991794     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.25     Document Type: Conference Paper

References (50)

1. L. Barto, "The dichotomy for conservative constraint satisfaction problems revisited," in Proceedings of the 26th IEEE Symposium on Logic in Computer Science (LICS'11). IEEE Computer Society, 2011, pp. 301-310.
2. L. Barto and M. Kozik, "Constraint Satisfaction Problems of Bounded Width," in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS'09). IEEE Computer Society, 2009, pp. 461-471.
3. -, "Robust Satisfiability of Constraint Satisfaction Problems," in Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC'12). ACM, 2012, pp. 931-940.
4. L. Barto, M. Kozik, and T. Niven, "The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell)," SIAM Journal on Computing, vol. 38, no. 5, pp. 1782-1802, 2009.
5. S. Bistarelli, U. Montanari, and F. Rossi, "Semiring-based Constraint Satisfaction and Optimisation," Journal of the ACM, vol. 44, no. 2, pp. 201-236, 1997.
6. A. Bulatov, "A dichotomy theorem for constraint satisfaction problems on a 3-element set," Journal of the ACM, vol. 53, no. 1, pp. 66-120, 2006.
7. A. Bulatov, A. Krokhin, and P. Jeavons, "Classifying the Complexity of Constraints using Finite Algebras," SIAM Journal on Computing, vol. 34, no. 3, pp. 720-742, 2005.
8. A. A. Bulatov, "Complexity of conservative constraint satisfaction problems," ACM Transactions on Computational Logic, vol. 12, no. 4, p. 24, 2011.
9. D. Cohen, M. Cooper, P. Creed, P. Jeavons, and S. Živný, "An algebraic theory of complexity for discrete optimisation," Tech. Rep., July 2012, arXiv:1207.6692.
10. D. A. Cohen, M. C. Cooper, and P. G. Jeavons, "An Algebraic Characterisation of Complexity for Valued Constraints," in Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP'06), ser. Lecture Notes in Computer Science, vol. 4204. Springer, 2006, pp. 107-121.
11. -, "Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms," Theoretical Computer Science, vol. 401, no. 1-3, pp. 36-51, 2008.
12. D. A. Cohen, M. C. Cooper, P. G. Jeavons, and A. A. Krokhin, "The Complexity of Soft Constraint Satisfaction," Artificial Intelligence, vol. 170, no. 11, pp. 983-1016, 2006.
13. D. A. Cohen, P. Creed, P. G. Jeavons, and S. Živný, "An algebraic theory of complexity for valued constraints: Establishing a Galois connection," in Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), ser. Lecture Notes in Computer Science, vol. 6907. Springer, 2011, pp. 231-242.
14. M. C. Cooper, S. de Givry, M. Sánchez, T. Schiex, M. Zytnicki, and T. Werner, "Soft arc consistency revisited," Artificial Intelligence, vol. 174, no. 7-8, pp. 449-478, 2010.
15. M. C. Cooper and T. Schiex, "Arc consistency for soft constraints," Artificial Intelligence, vol. 154, no. 1-2, pp. 199-227, 2004.
16. Y. Crama and P. L. Hammer, Boolean Functions - Theory, Algorithms, and Applications. Cambridge University Press, 2011.
17. P. Creed and S. Živný, "On minimal weighted clones," in Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP'11), ser. Lecture Notes in Computer Science, vol. 6876. Springer, 2011, pp. 210-224.
18. N. Creignou, S. Khanna, and M. Sudan, Complexity Classification of Boolean Constraint Satisfaction Problems, ser. SIAM Monographs on Discrete Mathematics and Applications. SIAM, 2001, vol. 7.
19. V. Dalmau and A. Krokhin, "Robust satisfiability for CSPs: algorithmic and hardness results," 2011, in preparation.
20. V. Dalmau and J. Pearson, "Set Functions and Width 1 Problems," in Proceedings of the 5th International Conference on Constraint Programming (CP'99), ser. Lecture Notes in Computer Science, vol. 1713. Springer, 1999, pp. 159-173.
21. V. Deineko, P. Jonsson, M. Klasson, and A. Krokhin, "The approximability of Max CSP with fixed-value constraints," Journal of the ACM, vol. 55, no. 4, 2008.
22. T. Feder and M. Y. Vardi, "The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory," SIAM Journal on Computing, vol. 28, no. 1, pp. 57-104, 1998.
23. U. Feige, V. S. Mirrokni, and J. Vondrák, "Maximizing Non-monotone Submodular Functions," SIAM Journal on Computing, vol. 40, no. 4, pp. 1133-1153, 2011.
24. E. C. Freuder, "Synthesizing Constraint Expressions," Communications of the ACM, vol. 21, no. 11, pp. 958-966, 1978.
25. S. Fujishige and S. Iwata, "Bisubmodular Function Minimization," SIAM Journal on Discrete Mathematics, vol. 19, no. 4, pp. 1065-1073, 2005.
26. D. Gale, The Theory of Linear Economic Models. McGraw-Hill, 1960.
27. A. Huber and V. Kolmogorov, "Towards Minimizing k-Submodular Functions," in Proceedings of the 2nd International Symposium on Combinatorial Optimization (ISCO'12), 2012.
28. P. M. Idziak, P. Markovic, R. McKenzie, M. Valeriote, and R.Willard, "Tractability and learnability arising from algebras with few subpowers," SIAM Journal on Computing, vol. 39, no. 7, pp. 3023-3037, 2010.
29. S. Iwata, L. Fleischer, and S. Fujishige, "A combinatorial strongly polynomial algorithm for minimizing submodular functions," Journal of the ACM, vol. 48, no. 4, pp. 761-777, 2001.
30. P. G. Jeavons, "On the Algebraic Structure of Combinatorial Problems," Theoretical Computer Science, vol. 200, no. 1-2, pp. 185-204, 1998.
31. P. G. Jeavons, D. A. Cohen, and M. Gyssens, "Closure Properties of Constraints," Journal of the ACM, vol. 44, no. 4, pp. 527-548, 1997.
32. P. Jonsson, A. A. Krokhin, and F. Kuivinen, "Hard constraint satisfaction problems have hard gaps at location 1," Theoretical Computer Science, vol. 410, no. 38-40, pp. 3856-3874, 2009.
33. P. Jonsson, F. Kuivinen, and J. Thapper, "Min CSP on Four Elements: Moving Beyond Submodularity," in Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP'11), ser. Lecture Notes in Computer Science, vol. 6876. Springer, 2011, pp. 438-453.
34. S. Khanna, M. Sudan, L. Trevisan, and D. Williamson, "The approximability of constraint satisfaction problems," SIAM Journal on Computing, vol. 30, no. 6, pp. 1863-1920, 2001.
35. S. Khot, "On the unique games conjecture (invited survey)," in Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC'10). IEEE Computer Society, 2010, pp. 99-121.
36. #-convex and bisubmodular functions," in Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), ser. Lecture Notes in Computer Science, vol. 6907. Springer, 2011, pp. 400-411.
37. V. Kolmogorov and S. Živný, "The complexity of conservative valued CSPs," in Proceedings of the 23rd Annual ACMSIAM Symposium on Discrete Algorithms (SODA'12). SIAM, 2012, pp. 750-759, full version available on arXiv:1110.2809.
38. A. Krokhin and B. Larose, "Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction," SIAM Journal on Discrete Mathematics, vol. 22, no. 1, pp. 312-328, 2008.
39. F. Kuivinen, "On the complexity of submodular function minimisation on diamonds," Discrete Optimization, vol. 8, no. 3, pp. 459-477, 2011.
40. G. Kun, R. O'Donnell, S. Tamaki, Y. Yoshida, and Y. Zhou, "Linear programming, width-1 CSPs, and robust satisfaction," in Proceedings of the 3rd Innovations in Theoretical Computer Science (ITCS'12). ACM, 2012, pp. 484-495.
41. S. L. Lauritzen, Graphical Models. Oxford University Press, 1996.
42. A. K. Mackworth, "Consistency in Networks of Relations," Artificial Intelligence, vol. 8, pp. 99-118, 1977.
43. O. L. Mangasarian, Nonlinear programming, ser. Classics in applied mathematics. SIAM, 1994.
44. S. T. McCormick and S. Fujishige, "Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization," Mathematical Programming, vol. 122, no. 1, pp. 87-120, 2010.
45. U. Montanari, "Networks of Constraints: Fundamental properties and applications to picture processing," Information Sciences, vol. 7, pp. 95-132, 1974.
46. P. Raghavendra, "Optimal algorithms and inapproximability results for every CSP?" in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08). ACM, 2008, pp. 245-254.
47. T. J. Schaefer, "The Complexity of Satisfiability Problems," in Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC'78). ACM, 1978, pp. 216-226.
48. T. Schiex, H. Fargier, and G. Verfaillie, "Valued Constraint Satisfaction Problems: Hard and Easy Problems," in Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95), 1995, pp. 631-637.
49. A. Schrijver, "A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time," Journal of Combinatorial Theory, Series B, vol. 80, no. 2, pp. 346-355, 2000.
50. M. J. Wainwright and M. I. Jordan, "Graphical models, exponential families, and variational inference," Foundations and Trends in Machine Learning, vol. 1, no. 1-2, pp. 1-305, 2008.