Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Abstract
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. This paper strengthens this link. We study the problem of maximizing a supermodular function which is defined on a product of n copies of a fixed finite lattice and given by an oracle. We exhibit a large class of finite lattices for which this problem can be solved in oracle-polynomial time in n. We also obtain new large classes of tractable maximum constraint satisfaction problems.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
R. E. Burkard, B. Klinz, and R. Rudolf, Perspectives of Monge properties in optimization, Discrete Appl. Math., 70 (1996), pp. 95–161.
2.
D. Cohen, M. Cooper, and P. Jeavons, An algebraic characterization of complexity for valued constraints, Lecture Notes in Comput. Sci. 4204, Springer-Verlag, Berlin, 2006, pp. 107–121.
3.
D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin, Supermodular functions and the complexity of MAX CSP, Discrete Appl. Math., 149 (2005), pp. 53–72.
4.
D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin, The complexity of soft constraint satisfaction, Artificial Intelligence, 170 (2006), pp. 983–1016.
5.
N. Creignou, S. Khanna, and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monogr. Discrete Math. Appl. 7, SIAM, Philadelphia, 2001.
6.
R. Dechter, Constraint Processing, Morgan Kaufmann, San Francisco, CA, 2003.
7.
V. Deineko, P. Jonsson, M. Klasson, and A. Krokhin, Supermodularity on chains and complexity of maximum constraint satisfaction, in Proceedings of Eurocomb'05, Vol. AE, DMTCS, Berlin, Germany, 2005, pp. 51–56.
8.
V. Deineko, P. Jonsson, M. Klasson, and A. Krokhin, The Approximability of MAX CSP with Fixed-Value Constraints, Technical report CoRR cs.CC/0602075, 2006.
9.
A. Frank, Applications of submodular functions, in Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 187, K. Walker, ed., Cambridge University Press, Cambridge, UK, 1993, pp. 85–136.
10.
A. Frank, Matroids and submodular functions, in Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffoli, and S. Martello, eds., John Wiley, Chichester, UK, 1997, pp. 65–80.
11.
S. Fujishige, Submodular Functions and Optimization, Ann. Discrete Math. 58, 2nd ed., Elsevier, Amsterdam, 2005.
12.
A. Goldberg and R. E. Tarjan, A new approach to the maximum-flow problem, J. Assoc. Comput. Mach., 35 (1988), pp. 921–940.
13.
G. Grätzer, General Lattice Theory, 2nd ed., Birkhäuser-Verlag, Basel, Switzerland, 2002.
14.
G. Grätzer and D. Kelly, Products of lattice varieties, Algebra Universalis, 21 (1985), pp. 33–45.
15.
D. Hobby and R. N. McKenzie, The Structure of Finite Algebras, Contemp. Math. 76, AMS, Providence, RI, 1988.
16.
S. Iwata, A fully combinatorial algorithm for submodular function minimization, J. Combin. Theory Ser. B, 84 (2002), pp. 203–212.
17.
S. Iwata, L. Fleischer, and S. Fujishige, A combinatorial strongly polynomial algorithm for minimizing submodular functions, J. ACM, 48 (2001), pp. 761–777.
18.
P. Jipsen and H. Rose, Varieties of Lattices, Lecture Notes in Math. 1533, Springer-Verlag, Berlin, 1992.
19.
P. Jonsson, M. Klasson, and A. Krokhin, The approximability of three-valued MAX CSP, SIAM J. Comput., 35 (2006), pp. 1329–1349.
20.
A. Krokhin and B. Larose, Maximum Constraint Satisfaction on Diamonds, Technical report CS-RR-408, Department of Computer Science, University of Warwick, Warwick, UK, 2004.
21.
A. Krokhin and B. Larose, Supermodular Sublattices in Products of Relatively Complemented Lattices, manuscript, 2006.
22.
V. B. Lender, The groupoid of prevarieties of lattices, Siberian Math. J., 16 (1975), pp. 1214–1223 (in Russian).
23.
A. Müller and D. Stoyan, Comparison Methods for Stochastic Models and Risks, Wiley Ser. Prob. Stat., Wiley & Sons, Chichester, UK, 2002.
24.
H. Narayanan, Submodular Functions and Electrical Networks, Ann. Discrete Math. 54, North-Holland, Amsterdam, 1997.
25.
S. D. Promislow and V. R. Young, Supermodular functions on finite lattices, Order, 22 (2005), pp. 389–413.
26.
A. Schrijver, A combinatorial algorithm minimizing submodular functions in polynomial time, J. Combin. Theory Ser. B, 80 (2000), pp. 346–355.
27.
A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Vol. B, Matroids, Trees, Stable Sets, Springer-Verlag, Berlin, 2003.
28.
D. Topkis, Supermodularity and Complementarity, Frontiers Econom. Res., Princeton University Press, Princeton, NJ, 1998.
Information & Authors
Information
Published In
Copyright
Copyright © 2008 Society for Industrial and Applied Mathematics.
History
Submitted: 11 September 2006
Accepted: 4 November 2007
Published online: 27 February 2008
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Minimizing submodular functions on diamonds via generalized fractional matroid matchingsJournal of Combinatorial Theory, Series B, Vol. 157 | 1 Nov 2022
- Maximizing Cloud Revenue using Dynamic Pricing of Multiple Class Virtual MachinesIEEE Transactions on Cloud Computing, Vol. 9, No. 2 | 1 Apr 2021
- A Non-Extendibility Certificate for Submodularity and ApplicationsComputing and Combinatorics | 27 August 2020
- Polynomial combinatorial algorithms for skew-bisubmodular function minimizationMathematical Programming, Vol. 171, No. 1-2 | 22 June 2017
- The Power of Linear Programming for General-Valued CSPsSIAM Journal on Computing, Vol. 44, No. 1 | 5 February 2015
- Skew Bisubmodularity and Valued CSPsSIAM Journal on Computing, Vol. 43, No. 3 | 8 May 2014
- Oracle Tractability of Skew Bisubmodular FunctionsSIAM Journal on Discrete Mathematics, Vol. 28, No. 4 | 14 October 2014
- A Min-Max Theorem for Transversal Submodular Functions and Its ImplicationsSIAM Journal on Discrete Mathematics, Vol. 28, No. 4 | 23 October 2014
- The complexity of conservative valued CSPsJournal of the ACM, Vol. 60, No. 2 | 3 May 2013
- The Power of Linear Programming for Valued CSPs2012 IEEE 53rd Annual Symposium on Foundations of Computer Science | 1 Oct 2012
- Towards Minimizing k-Submodular FunctionsCombinatorial Optimization | 1 Jan 2012
- BackgroundThe Complexity of Valued Constraint Satisfaction Problems | 1 Jan 2012
- Expressibility of Submodular LanguagesThe Complexity of Valued Constraint Satisfaction Problems | 1 Jan 2012
- Tractable LanguagesThe Complexity of Valued Constraint Satisfaction Problems | 1 Jan 2012
- The Power of Linear ProgrammingThe Complexity of Valued Constraint Satisfaction Problems | 1 Jan 2012
- On the complexity of submodular function minimisation on diamondsDiscrete Optimization, Vol. 8, No. 3 | 1 Aug 2011
- Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular FunctionsMathematical Foundations of Computer Science 2011 | 1 Jan 2011
- Min CSP on Four Elements: Moving beyond SubmodularityPrinciples and Practice of Constraint Programming – CP 2011 | 1 Jan 2011
- The expressive power of binary submodular functionsDiscrete Applied Mathematics, Vol. 157, No. 15 | 1 Aug 2009
- The Expressive Power of Binary Submodular FunctionsMathematical Foundations of Computer Science 2009 | 1 Jan 2009
- Colouring, constraint satisfaction, and complexityComputer Science Review, Vol. 2, No. 3 | 1 Dec 2008
- The approximability of MAX CSP with fixed-value constraintsJournal of the ACM, Vol. 55, No. 4 | 18 September 2008
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].