Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms

Theoretical Computer Science

Volumn 401, Issue 1-3, 2008, Pages 36-51

  Cohen, David A ^a   Cooper, Martin C ^b   Jeavons, Peter G ^c  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b IRIT   (France)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Constraint satisfaction problem; Discrete optimization; Majority operation; Modular decomposition; Submodularity; Tournament operation; Tractability; Valued constraint satisfaction

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; FINITE DIFFERENCE METHOD; FUNCTION EVALUATION; INTEGER PROGRAMMING; LOGIC PROGRAMMING; OPTIMIZATION;

DISCRETE OPTIMIZATION PROBLEMS; ELSEVIER (CO); FINITE DOMAINS; FINITE SETS; FUNDAMENTAL PROBLEMS; GENERAL (CO); HORN CLAUSES; OPTIMIZ ATION PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; PROPERTY (S); SUBMODULAR FUNCTION MINIMIZATION; SUBMODULAR FUNCTIONS; SUBMODULARITY; TRACTABLE CLASS;

SET THEORY;

EID: 45049086541     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.03.015     Document Type: Article

References (52)

1. Anglès d'Auriac J.-Ch., Igloi F., Preismann M., and Sebö A. Optimal cooperation and submodularity for computing Potts' partition functions with a large number of statistics. Journal of Physics A: Math. Gen. 35 (2002) 6973-6983
2. Billionet A., and Minoux M. Maximizing a supermodular pseudo-boolean function: a polynomial algorithm for cubic functions. Discrete Applied Mathematics 12 (1985) 1-11
3. Bulatov A.A. A dichotomy theorem for constraint satisfaction problems on a three-element set. Journal of the ACM 53 1 (2006) 66-120
4. A.A. Bulatov, Tractable conservative constraint satisfaction problems, in: Proc. 18th IEEE Symposium on Logic in Computer Science, LICS'03, 2003, pp. 321-330
5. Bulatov A.A. Combinatorial problems raised from 2-semilattices. Journal of Algebra (2006) 321-339
6. A.A. Bulatov, P. Jeavons, Tractable constraints closed under a binary operation, Oxford University Computing Laboratory Technical Report, PRG-TR-12-00, (2000)
7. Bulatov A.A., Krokhin A.A., and Jeavons P.G. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34 (2005) 720-742
8. Cohen D., Cooper M.C., and Jeavons P. A complete characterisation of complexity for Boolean constraint optimization problems. Proc. 10th Int. Conf. on Priciples and Practice of Constraint Programming. CP'04. LNCS vol. 3258 (2004) 212-226
9. Cohen D., Cooper M.C., Jeavons P., and Krokhin A. Soft constraints: complexity and multimorphisms. Proc. CP'03. LNCS vol. 2833 (2003) 244-258
10. Cohen D., Cooper M.C., Jeavons P., and Krokhin A. A maximal tractable class of soft constraints. Journal of Artificial Intelligence Research 22 (2004) 1-22
11. Cohen D., Cooper M.C., Jeavons P., and Krokhin A. Supermodular functions and the complexity of Max-CSP. Discrete Applied Mathematics 149 (2005) 53-72
12. Cohen D., Cooper M.C., Jeavons P., and Krokhin A. The complexity of soft constraint satisfaction. Artificial Intelligence 170 11 (2006) 983-1016
13. Cohen D., Cooper M.C., and Jeavons P. An algebraic characterisation of complexity for valued constraints. Proc. CP'06. LNCS vol. 4204 (2006) 107-121
14. Cooper M.C. An optimal k-consistency algorithm. Artificial Intelligence 41 (1989) 89-95
15. Cooper M.C. Reduction operations in fuzzy and valued constraint satisfaction. Fuzzy Sets and Systems 134 (2003) 311-342
16. Cooper M.C. High-order consistency in valued constraint satisfaction. Constraints 10 (2005) 283-305
17. Cooper M.C., and Schiex T. Arc consistency for soft constraints. Artificial Intelligence 154 1-2 (2004) 199-227
18. Creignou N. A dichotomy theorem for maximum generalised satisfiability problems. Journal of Computer and Systems Sciences 51 3 (1995) 511-522
19. Creignou N., Khanna S., and Sudan M. Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications vol. 7 (2001)
20. Cunningham W.H. Minimum cuts, modular functions, and matroid polyhedra. Networks 15 2 (1985) 205-215
21. Dahlhaus E., Gustedt J., and McConnell R.M. Efficient and practical algorithms for sequential modular decomposition. Journal of Algorithms 41 2 (2001) 360-387
22. Dechter R. Constraint Processing (2003), Morgan Kaufmann
23. Dowling W.F., and Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 1 3 (1984) 267-284
24. Ekin O., Hammer P.L., and Peled U.N. Horn functions and submodular boolean functions. Theoretical Computer Science 175 (1997) 257-270
25. Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM Journal on Computing 28 1 (1998) 57-104
26. Fujishige S. Submodular Functions and Optimisation. 2nd edn. Annals of Discrete Mathematics vol. 58 (2005), Elsevier
27. Fujishige S., and Patkar S.B. Realization of set functions as cut functions of graphs and hypergraphs. Discrete Mathematics 226 (2001) 199-210
28. Fujishige S., and Iwata S. Bisubmodular function minimization. SIAM Journal on Discrete Mathematics 19 (2006) 1065-1073
29. Gutin G., Rafiey A., and Yeo A. Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Applied Mathematics 154 (2006) 890-897
30. Grötschel M., Lovász L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-198 corrigendum: Combinatorica 4 (1984) 291-295
31. Han C.-C., and Lee C.-H. Comments on Mohr and Henderson's path consistency algorithm. Artificial Intelligence 36 (1988) 125-130
32. Iwata S. A fully combinatorial algorithm for submodular function minimization. Journal of Combinatorial Theory, Series B 84 2 (2002) 203-212
33. Iwata S. A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput. 32 4 (2003) 833-840
34. Iwata S., Fleischer L., and Fujishige S. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. Journal of the ACM 48 4 (2001) 761-777
35. Jeavons P.G. On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185-204
36. Jeavons P., Cohen D., and Cooper M.C. Constraints, consistency and closure. Artificial Intelligence 101 (1998) 251-265
37. Jeavons P.G., Cohen D.A., and Gyssens M. Closure properties of constraints. Journal of the ACM 44 (1997) 527-548
38. Jeavons P.G., and Cooper M.C. Tractable constraints on ordered domains. Artificial Intelligence 79 2 (1995) 327-339
39. Jonsson P., Klasson M., and Krokhin A. The approximability of three-valued Max CSP. SIAM Journal on Computing 35 6 (2006) 1329-1349
40. Khanna S., Sudan M., Trevisan L., and Williamson D. The approximability of constraint satisfaction problems. SIAM Journal on Computing 30 6 (2001) 1863-1920
41. Krokhin A., and Larose B. Maximum constraint satisfaction on diamonds. Proceedings CP'05. LNCS vol. 3709 (2005) 388-402
42. Larrosa J., and Schiex T. Solving weighted CSP by maintaining arc consistency. Artificial Intelligence 159 (2004) 1-26
43. McConnell R.M., and de Montgolfier F. Linear-time modular decomposition of directed graphs. Discrete Applied Mathematics 145 2 (2005) 198-209
44. Narayanan H. Submodular Functions and Electrical Networks (1997), North-Holland, Amsterdam
45. Narayanan H. A note on the minimization of symmetric and general submodular functions. Discrete Applied Mathematics 131 2 (2003) 513-522
46. R. Mohr, G. Masini, Good old discrete relaxation, in: Proc. European Conf. Artificial Intelligence, Munich 1988, pp. 651-656
47. J.B. Orlin, A faster strongly polynomial time algorithm for submodular function minimization, Mathematical Programming, (in press)
48. Queyranne M. Minimising symmetric submodular functions. Mathematical Programming 82 1-2 (1998) 3-12
49. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings of the 10th ACM Symposium on the Theory of Computing, STOC'78, 1978, pp. 216-226
50. T. Schiex, H. Fargier, G. Verfaillie, Valued constraint satisfaction problems: hard and easy problems, in: Proc. of the 14th IJCAI, Montreal, Canada, 1995, pp. 631-637
51. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Ser. B 80 (2000) 346-355
52. Topkis D. Supermodularity and Complementarity (1998), Princeton University Press