Towards minimizing k-submodular functions

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

Volumn 7422 LNCS, Issue , 2012, Pages 451-462

  Huber, Anna ^a   Kolmogorov, Vladimir ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE FUNCTIONS; GREEDY ALGORITHMS; MAXIMIZATION PROBLEM; SUBMODULAR; SUBMODULAR FUNCTIONS;

COMBINATORIAL OPTIMIZATION;

GEOMETRY;

EID: 84865269903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32147-4_40     Document Type: Conference Paper

References (39)

1. Bouchet, A.: Greedy algorithm and symmetric matroids. Math. Progr. 38, 147-159 (1987)
2. Bouchet, A.: Multimatroids I. coverings by independent sets. SIAM J. Discrete Math. 10(4), 626-646 (1997)
3. Bouchet, A.: Multimatroids II. orthogonality, minors and connectivity. Electr. J. Comb. 5 (1998)
4. Bouchet, A.: Multimatroids III. tightness and fundamental graphs. Eur. J. Comb. 22(5), 657-677 (2001)
5. Bouchet, A., Cunningham, W.H.: Delta-matroids, jump systems and bisubmodular polyhedra. SIAM J. Discrete Math. 8, 17-32 (1995)
6. Chandrasekaran, R., Kabadi, S.N.: Pseudomatroids. Disc. Math. 71, 205-217 (1988)
7. Cohen, D., Cooper, M., Jeavons, P.: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science 401(1), 36-51 (2008)
8. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: The complexity of soft constraint satisfaction. Artificial Intelligence 170(11), 983-1016 (2006)
9. Cunningham, W.H., Green-Krótki, J.: b-matching degree-sequence polyhedra. Combinatorica 11(3), 219-230 (1991)
10. Deineko, V., Jonsson, P., Klasson, M., Krokhin, A.: The approximability of max CSP with fixed-value constraints. J. ACM 55(4) (2008)
11. Dunstan, F.D.J., Welsh, D.J.A.: A greedy algorithm for solving a certain class of linear programmes. Math. Progr. 5, 338-353 (1973)
12. Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Schönheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 69-87. Gordon and Breach (1970)
13. Frank, A.: Applications of submodular functions. In: Walker, K. (ed.) Surveys in Combinatorics, pp. 85-136. Cambridge University Press (1993)
14. Fujishige, S.: A min-max theorem for bisubmodular polyhedra. SIAM J. Discrete Math. 10(2), 294-308 (1997)
15. Fujishige, S.: Submodular Functions and Optimization. Elsevier (2005)
16. Fujishige, S., Iwata, S.: Bisubmodular function minimization. SIAM J. Discrete Math. 19(4), 1065-1073 (2006)
17. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197 (1981)
18. Iwata, S.: Submodular function minimization. Math. Progr. 112(1), 45-64 (2008)
19. Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4), 761-777 (2001)
20. Iwata, S., Orlin, J.: A simple combinatorial algorithm for submodular function minimization. In: SODA, pp. 1230-1237 (2009)
21. Jonsson, P., Kuivinen, F., Thapper, J.: Min CSP on Four Elements: Moving beyond Submodularity. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 438-453. Springer, Heidelberg (2011)
22. Kabadi, S.N., Chandrasekaran, R.: On totally dual integral systems. Discrete Appl. Math. 26, 87-104 (1990)
23. #-Convex and Bisubmodular Functions. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 400-411. Springer, Heidelberg (2011)
24. Kolmogorov, V., Zivny, S.: The complexity of conservative valued CSPs. In: SODA (2012)
25. Krokhin, A., Larose, B.: Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction. SIAM J. Discrete Math. 22(1), 312-328 (2008)
26. Kuivinen, F.: On the complexity of submodular function minimisation on diamonds. Discrete Optimization 8(3), 459-477 (2011)
27. Lovász, L.: Submodular functions and convexity. In: Bachem, A., Grötschel, M., Korte, B. (eds.) Math. Progr.: The State of the Art, pp. 235-257 (1983)
28. McCormick, S.T., Fujishige, S.: Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Math. Progr. 122, 87-120 (2010)
29. McCormick, S.: Submodular function minimization. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Handbook on Discr. Opt., pp. 321-391. Elsevier (2006)
30. Nakamura, M.: A characterization of greedy sets: universal polymatroids (I). Scientific Papers of the College of Arts and Sciences 38, 155-167 (1998)
31. Orlin, J.: A faster strongly polynomial time algorithm for submodular function minimization. Math. Progr. 118, 237-251 (2009)
32. Qi, L.: Directed submodularity, ditroids and directed submodular flows. Math. Progr. 42, 579-599 (1988)
33. Raghavendra, P.: Approximating NP-hard Problems: Efficient Algorithms and their Limits. PhD Thesis (2009)
34. Schrijver, A.: A combinatorial algorithm minimizing submodular functions in polynomial time. Journal of Combinatorial Theory, Ser. B 80, 346-355 (2000)
35. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency (2004)
36. Takhanov, R.: A dichotomy theorem for the general minimum cost homomorphism problem. In: STACS, pp. 657-668 (2010)
37. Thapper, J., Živný, S.: The Power of Linear Programming for Valued CSPs. ArXiv abs/1204.1079 (2012)
38. Topkis, D.M.: Minimizing a submodular function on a lattice. Operations Research 26(2), 305-321 (1978)
39. Topkis, D.M.: Supermodularity and complementarity. Princeton Univ. Press (1998)