On the complexity of submodular function minimisation on diamonds

Discrete Optimization

Volumn 8, Issue 3, 2011, Pages 459-477

  Kuivinen, Fredrik ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Combinatorial optimization; Diamonds; Lattices; Submodular function minimization

Indexed keywords

CHARACTERISATION; FINITE LATTICES; MIN-MAX THEOREM; ORACLE ACCESS; POSITIVE INTEGERS; SQUARE CUP; SUBMODULAR; SUBMODULAR FUNCTION MINIMIZATION; SUBMODULAR FUNCTIONS; TIME POLYNOMIALS;

COMBINATORIAL OPTIMIZATION;

DIAMONDS;

EID: 79960108787     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2011.04.001     Document Type: Article

References (32)

1. A. Frank Submodular functions in graph theory Discrete Math. 111 13 1993 231 243
2. L.S. Shapley Cores of convex games Int. J. Game Theory 1 1 1971 11 26
3. T.S. Han The capacity region of a general multiple access channel with certain correlated sources Inf. Control 40 1979 37 60
4. J.-C. Angls-d'Auriac, F. Iglói, M. Preissmann, and Seb Optimal cooperation and submodularity for computing Potts' partition functions with a large number of states J. Phys. A: Math. Gen. 35 11 2002 6973 6983 (Pubitemid 37049308)
5. S. Fujishige Theory of submodular programs: a Fenchel-type minmax theorem and subgradients of submodular functions Math. Program. 29 2 1984 142 155 (Pubitemid 14652125)
6. L. Lovász Submodular functions and convexity A. Bachem, M. Grtschel, B. Korte, Mathematical ProgrammingThe State of the Art 1982 Springer 235 257
7. S. Fujishige Submodular Functions and Optimization 2nd ed. Ann. Discrete Math. vol. 58 2005 Elsevier Science
8. S. Iwata Submodular function minimization Math. Program. 112 2008 45 64 (Pubitemid 47167324)
9. S.T. McCormick Submodular function minimization K. Aardal, G. Nemhauser, R. Weismantel, Handbook on Discrete Optimization 2007 Elsevier 321 391 (Chapter 7)
10. M. Grtschel, L. Lovász, and A. Schrijver The ellipsoid method and its consequences in combinatorial optimization Combinatorica 1 2 1981 169 197
11. A. Schrijver A combinatorial algorithm minimizing submodular functions in strongly polynomial time J. Combin. Theory Ser. B 80 2 2000 346 355
12. S. Iwata, L. Fleischer, and S. Fujishige A combinatorial strongly polynomial algorithm for minimizing submodular functions J. ACM 48 4 2001 761 777
13. J.B. Orlin A faster strongly polynomial time algorithm for submodular function minimization Integer Programming and Combinatorial Optimization, 12th International IPCO Conference IPCO'07 Lecture Notes in Computer Science vol. 4513 2007 Springer-Verlag 240 251
14. S. Iwata A faster scaling algorithm for minimizing submodular functions Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization IPCO'02 Lecture Notes in Computer Science vol. 2337 2002 Springer-Verlag 1 8
15. A. Krokhin, and B. Larose Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction SIAM J. Discrete Math. 22 1 2008 312 328
16. D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin Supermodular functions and the complexity of Max CSP Discrete Appl. Math. 149 13 2005 53 72 (Pubitemid 41000307)
17. J. Edmonds Submodular functions, matroids, and certain polyhedra R. Guy, H. Hanani, N. Sauer, J. Schnheim, Combinatorial Structures and their Applications 1970 Gordon and Breach
18. V. Deineko, P. Jonsson, M. Klasson, and A. Krokhin The approximability of Max CSP with fixed-value constraints J. ACM 55 4 2008 1 37
19. P. Jonsson, M. Klasson, and A. Krokhin The approximability of three-valued Max CSP SIAM J. Comput. 35 6 2006 1329 1349 (Pubitemid 44935682)
20. N. Creignou A dichotomy theorem for maximum generalized satisfiability problems J. Comput. Syst. Sci. 51 3 1995 511 522
21. D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin The complexity of soft constraint satisfaction Artificial Intelligence 170 11 2006 909 1030
22. P. Raghavendra Optimal algorithms and inapproximability results for every CSP? Proceedings of the 40th Annual ACM Symposium on Theory of Computing STOC'08 2008 ACM Press New York, NY, USA 245 254
23. H. Ito, S. Iwata, and K. Murota Block-triangularizations of partitioned matrices under similarity/equivalence transformations SIAM J. Matrix Anal. Appl. 15 4 1994 1226 1255
24. S. Iwata, and K. Murota A minimax theorem and a DulmageMendelsohn type decomposition for a class of generic partitioned matrices SIAM J. Matrix Anal. Appl. 16 3 1995 719 734
25. M. Grtschel, L. Lovász, and A. Schrijver Geometric Algorithms and Combinatorial Optimization Algorithms and Combinatorics vol. 2 1988 Springer
26. A. Schrijver Theory of Linear and Integer Programming 1986 John Wiley & Sons, Inc. New York, NY, USA
27. C. Carathéodory ber den variabilittsbereich der Fourierschen konstanten von positiven harmonischen funktionen Rend. Circ. Mat. Palermo 32 1911 193 217
28. A. Schrijver Combinatorial OptimizationPolyhedra and Efficiency 2003 Springer
29. D.S. Hochbaum, N. Megiddo, J. Naor, and A. Tamir Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality Math. Program. 62 1993 69 83
30. G. Appa, and B. Kotnyek Rational and integral k-regular matrices Discrete Math. 275 13 2004 1 15
31. D. Gijswijt, G. Pap, An algorithm for weighted fractional matroid matching, Technical Report, EGRES TR-2008-11, MTA-ELTE Egerváry Research Group on Combinatorial Optimization, Dept. of Operations Research, Etvs University, Budapest, 2008.
32. S. Iwata A capacity scaling algorithm for convex cost submodular flows Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms SODA'96 1996 Society for Industrial and Applied Mathematics Philadelphia, PA, USA 482 489