The expressive power of binary submodular functions

Discrete Applied Mathematics

Volumn 157, Issue 15, 2009, Pages 3347-3358

  Živný, Stanislav ^a   Cohen, David A ^b   Jeavons, Peter G ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Decomposition of submodular functions; Min Cut; Pseudo Boolean optimisation; Submodular function minimisation

Indexed keywords

ALGEBRAIC PROPERTIES; EXPRESSIBILITY; EXPRESSIVE POWER; MIN-CUT; OPTIMISATIONS; PSEUDO-BOOLEAN; PSEUDO-BOOLEAN OPTIMISATION; SUBMODULAR; SUBMODULAR FUNCTION MINIMISATION; SUBMODULAR FUNCTIONS;

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; OPTIMIZATION;

BOOLEAN FUNCTIONS;

EID: 69249212370     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.07.001     Document Type: Article

References (56)

1. Besag J. On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society, Series B 48 3 (1986) 259-302
2. Billionet A., and Minoux M. Maximizing a supermodular pseudo-Boolean function: A polynomial algorithm for cubic functions. Discrete Applied Mathematics 12 1 (1985) 1-11
3. Bistarelli S., Fargier H., Montanari U., Rossi F., Schiex T., and Verfaillie G. Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints 4 3 (1999) 199-240
4. Boros E., and Hammer P.L. Pseudo-Boolean optimization. Discrete Applied Mathematics 123 1-3 (2002) 155-225
5. Bulatov A., Krokhin A., and Jeavons P. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34 3 (2005) 720-742
6. Burkard R., Klinz B., and Rudolf R. Perspectives of Monge properties in optimization. Discrete Applied Mathematics 70 2 (1996) 95-161
7. Cohen D., Cooper M., Jeavons P., and Krokhin A. A maximal tractable class of soft constraints. Journal of Artificial Intelligence Research 22 (2004) 1-22
8. Cohen D., Cooper M., Jeavons P., and Krokhin A. Supermodular functions and the complexity of max-csp. Discrete Applied Mathematics 149 1-3 (2005) 53-72
9. Cohen D.A., Cooper M.C., and Jeavons P.G. An algebraic characterisation of complexity for valued constraints. Proceedings of the 12th International Conference on Principles and Practice of Contraint Programming. CP'06. Lecture Notes in Computer Science vol. 4204 (2006), Springer
10. Cohen D.A., Cooper M.C., and Jeavons P.G. Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science 401 1-3 (2008) 36-51
11. Cohen D.A., Cooper M.C., Jeavons P.G., and Krokhin A.A. The complexity of soft constraint satisfaction. Artificial Intelligence 170 11 (2006) 983-1016
12. Cooper M.C. Minimization of locally defined submodular functions by optimal soft arc consistency. Constraints 13 4 (2008) 437-458
13. Crama Y. Recognition problems for special classes of polynomials in 0-1 variables. Mathematical Programming 44 1-3 (1989) 139-155
14. Creignou N., Khanna S., and Sudan M. Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications vol. 7 (2001), SIAM
15. V. Deineko, P. Jonsson, M. Klasson, A. Krokhin, The approximability of Max CSP with fixed-value constraints, Journal of the ACM, 55 (4)
16. Feige U., Mirrokni V.S., and Vondrák J. Maximizing non-monotone submodular functions. Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science. FOCS'07 (2007), IEEE Computer Society
17. Freedman D., and Drineas P. Energy minimization via graph cuts: Settling what is possible. IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR'05 (2005), IEEE Computer Society
18. Fujishige S. Submodular Functions and Optimization. 2nd ed. Annals of Discrete Mathematics vol. 58 (2005), North-Holland, Amsterdam
19. Gallo G., and Simeone B. On the supermodular knapsack problem. Mathematical Programming 45 1-3 (1988) 295-309
20. Geman S., and Geman D. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6 6 (1984) 721-741
21. Grötschel M., Lovasz L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 2 (1981) 169-198
22. Grötschel M., Lovasz L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics vol. 2 (1988), Springer
23. Gutin G., Rafiey A., Yeo A., and Tso M. Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Applied Mathematics 154 6 (2006) 881-889
24. Hammer P.L. Some network flow problems solved with pseudo-Boolean programming. Operations Research 13 3 (1965) 388-399
25. Iwata S. A fully combinatorial algorithm for submodular function minimization. Journal of Combinatorial Theory, Series B 84 2 (2002) 203-212
26. Iwata S. A faster scaling algorithm for minimizing submodular functions. SIAM Journal on Computing 32 4 (2003) 833-840
27. Iwata S. Submodular function minimization. Mathematical Programming 112 1 (2008) 45-64
28. Iwata S., Fleischer L., and Fujishige S. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM 48 4 (2001) 761-777
29. S. Iwata, J.B. Orlin, A simple combinatorial algorithm for submodular function minimization, in: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'09, 2009
30. Jeavons P., Cohen D., and Cooper M.C. Constraints, consistency and closure. Artificial Intelligence 101 1-2 (1998) 251-265
31. Jonsson P., Klasson M., and Krokhin A. The approximability of three-valued MAX CSP. SIAM Journal on Computing 35 6 (2006) 1329-1349
32. Kohli P., Ladický L., and Torr P. Robust higher order potentials for enforcing label consistency. International Journal of Computer Vision 82 3 (2009) 302-324
33. Kolmogorov V., and Zabih R. What energy functions can be minimized via graph cuts?. IEEE Transactions on Pattern Analysis and Machine Intelligence 26 2 (2004) 147-159
34. Korte B., and Vygen J. Combinatorial Optimization. 4th ed. Algorithms and Combinatorics vol. 21 (2007), Springer
35. Krokhin A., and Larose B. Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction. SIAM Journal on Discrete Mathematics 22 1 (2008) 312-328
36. Lauritzen S.L. Graphical Models (1996), Oxford University Press
37. Lovász L. Submodular functions and convexity. In: Bachem A., Grötschel M., and Korte B. (Eds). Mathematical Programming-The State of the Art (1983), Springer, Berlin
38. Motzkin T., Raiffa H., Thompson G., and Thrall R. The double description method. In: Kuhn H.W., and Tucker A.W. (Eds). Contributions to the Theory of Games vol. 2 (1953), Princeton University Press 51-73
39. Narayanan H. Submodular Functions and Electrical Networks (1997), North-Holland, Amsterdam
40. Nemhauser G., and Wolsey L. Integer and Combinatorial Optimization (1988), John Wiley & Sons
41. Nemhauser G., Wolsey L., and Fisher M. An analysis of approximations for maximizing submodular set functions-I. Mathematical Programming 14 1 (1978) 265-294
42. Orlin J.B. A faster strongly polynomial time algorithm for submodular function minimization. Mathematical Programming 118 2 (2009) 237-251
43. Promislow S., and Young V. Supermodular functions on finite lattices. Order 22 4 (2005) 389-413
44. Ramalingam S., Kohli P., Alahari K., and Torr P. Exact inference in multi-label CRFs with higher order cliques. IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR'08 (2008), IEEE Computer Society
45. Rhys J. A selection problem of shared fixed costs and network flows. Management Science 17 3 (1970) 200-207
46. Rosenberg I. Reduction of bivalent maximization to the quadratic case. Cahier du Centre dEtudes de Recherche Oprationnelle 17 (1975) 71-74
47. In: Rossi F., van Beek P., and Walsh T. (Eds). The Handbook of Constraint Programming (2006), Elsevier
48. T. Schiex, H. Fargier, G. Verfaillie, Valued constraint satisfaction problems: Hard and easy problems, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence, IJCAI'95, 1995
49. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B 80 2 (2000) 346-355
50. Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics vol. 24 (2003), Springer
51. Topkis D. Supermodularity and Complementarity (1998), Princeton University Press
52. Wainwright M.J., and Jordan M.I. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning 1 1-2 (2008) 1-305
53. Werner T. A linear programming approach to max-sum problem: A review. IEEE Transactions on Pattern Analysis and Machine Intelligence 29 7 (2007) 1165-1179
54. B. Zalesky, efficient determination of Gibbs estimators with submodular energy functions, February 2008. arXiv:math/0304041v1
55. Živný S., and Jeavons P.G. Classes of submodular constraints expressible by graph cuts. Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming. CP'08. Lecture Notes in Computer Science vol. 5202 (2008), Springer
56. S. Živný, P.G. Jeavons, Which submodular functions are expressible using binary submodular functions?, Research Report CS-RR-08-08, Computing Laboratory, University of Oxford, Oxford, UK, June 2008