Classes of submodular constraints expressible by graph cuts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5202 LNCS, Issue , 2008, Pages 112-127

  Živný, Stanislav ^a   Jeavons, Peter G ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; POLYNOMIAL APPROXIMATION;

BOOLEAN DOMAINS; COMBINATORIAL OPTIMISATION; GRAPH CUTS; OPTIMISATION; POLYNOMIAL TIMES; SUBMODULAR; VALUED CONSTRAINT SATISFACTIONS;

CONSTRAINT THEORY;

EID: 55349134938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_8     Document Type: Conference Paper

References (25)

1. Billionet, A., Minoux, M.: Maximizing a supermodular pseudo-boolean function: a polynomial algorithm for cubic functions. D, App. Mathematics 12, 1-11 (1985)
2. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints 4, 199-240 (1999)
3. Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Applied Mathematics 123(1-3), 155-225 (2002)
4. Bulatov, A., Krokhin, A., Jeavons, P.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34(3), 720-742 (2005)
5. Cohen, D., Cooper, M., Jeavons, P.: An algebraic characterisation of complexity for valued constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 107-121. Springer, Heidelberg (2006)
6. Cohen, D., Cooper, M., Jeavons, P.: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science (in press, 2008)
7. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: Supermodular functions and the complexity of Max-CSP. Discrete Applied Mathematics 149, 53-72 (2005)
8. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: The complexity of soft constraint satisfaction. Artificial Intelligence 170, 983-1016 (2006)
9. Cooper, M.C.: Minimization of locally defined submodular functions by optimal soft arc consistency. Constraints 13 (2008)
10. Cooper, M.: High-order consistency in valued constraint satisfaction. Constraints 10, 283-305 (2005)
11. Creignou, N., Khanna, S., Sudan, M.: Complexity Classification of Boolean Constraint Satisfaction Problems. SiAM Monographs on Discrete Mathematics and Applications, vol. 7. SIAM, Philadelphia (2001)
12. Gallo, G., Simeone, B.: On the supermodular knapsack problem. Mathematical Programming 45, 295-309 (1988)
13. Goldberg, A., Tarjan, R.: A new approach to the maximum flow problem. Journal of the ACM 35, 921-940 (1988)
14. Iwata, S.: Submodular function minimization. Math. Progr. 112, 45-64 (2008)
15. Jeavons, P., Cohen, D., Cooper, M.: Constraints, consistency and closure. Artificial intelligence 101(1-2), 251-265 (1998)
16. Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147-159 (2004)
17. Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. information Sciences 7, 95-132 (1974)
18. Nemhauser, G., Wolsey, L.: integer and Combinatorial Optimization (1988)
19. Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. In: Fischetti, M., Williamson, D.P. (eds.) 1PCO 2007. LNCS, vol. 4513, pp. 240-251. Springer, Heidelberg (2007)
20. Rhys, J.: A selection problem of shared fixed costs and network flows. Management Science 17(3), 200-207 (1970)
21. Rossi, F., van Beek, P., W'alsh, T. (eds.): The Handbook of CP. Elsevier, Amsterdam (2006)
22. Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: hard and easy problems. In: IJCAI 1995, pp. 631-639 (1995)
23. Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. of Combinatorial Theory, Series B 80, 346-355 (2000)
24. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003)
25. Zalesky, B.: Efficient determination of Gibbs estimators with submodular energy functions. arXiv:math/0304041v1 (February 2008)