[1]M.Queryranne: A combinatorial algorithm for minimizing symmetric submodular functions, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms (SODA'95).
[2]Y.Kawahara, K.Nagano, K.Tsuda, J.Bilmes: Submodularity Cuts and Applications, Proccedings of the 23rd Annual Conference on Neural Information Processings Systems (NIPS'09).
[3]F.Bach: Convex analysis and optimization with submodular functions: a tutorial. Technical report 00527714, HAL, 2010.
[4]F.Bach:Structured Sparsity-Inducing Norms Through Submodular Functions.
[5]P.Stobbe, A.Krause: Efficient Minimization of Decomposable Submodular Functions.
[6]K.Nagano, Y.Kawahara and S.Iwata: Minimum Average Cost Clustering.
[7]M.Narasimhan, N.Jojic, J.Bilmes: Q-Clustering, (Proceedings of Neural Information Processing Systems), 2005.
[8]V.Kolmogorov: Generalized roof duality and bisubmodular functions.
[9]G.Leung, N.Quadrianto, A.Smola, K.Tsioutsiouliklis: Optimal Web-Scale Tiering as a Flow Problem.