{"volume":160,"publication_status":"published","page":"2246 - 2258","quality_controlled":"1","oa_version":"Preprint","title":"Minimizing a sum of submodular functions","date_created":"2018-12-11T12:01:29Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.1990"}],"_id":"3117","publication":"Discrete Applied Mathematics","oa":1,"year":"2012","date_published":"2012-10-01T00:00:00Z","publisher":"Elsevier","citation":{"chicago":"Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” <i>Discrete Applied Mathematics</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.dam.2012.05.025\">https://doi.org/10.1016/j.dam.2012.05.025</a>.","short":"V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258.","ama":"Kolmogorov V. Minimizing a sum of submodular functions. <i>Discrete Applied Mathematics</i>. 2012;160(15):2246-2258. doi:<a href=\"https://doi.org/10.1016/j.dam.2012.05.025\">10.1016/j.dam.2012.05.025</a>","ieee":"V. Kolmogorov, “Minimizing a sum of submodular functions,” <i>Discrete Applied Mathematics</i>, vol. 160, no. 15. Elsevier, pp. 2246–2258, 2012.","ista":"Kolmogorov V. 2012. Minimizing a sum of submodular functions. Discrete Applied Mathematics. 160(15), 2246–2258.","apa":"Kolmogorov, V. (2012). Minimizing a sum of submodular functions. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.dam.2012.05.025\">https://doi.org/10.1016/j.dam.2012.05.025</a>","mla":"Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” <i>Discrete Applied Mathematics</i>, vol. 160, no. 15, Elsevier, 2012, pp. 2246–58, doi:<a href=\"https://doi.org/10.1016/j.dam.2012.05.025\">10.1016/j.dam.2012.05.025</a>."},"department":[{"_id":"VlKo"}],"scopus_import":1,"status":"public","language":[{"iso":"eng"}],"abstract":[{"text":"We consider the problem of minimizing a function represented as a sum of submodular terms. We assume each term allows an efficient computation of exchange capacities. This holds, for example, for terms depending on a small number of variables, or for certain cardinality-dependent terms. A naive application of submodular minimization algorithms would not exploit the existence of specialized exchange capacity subroutines for individual terms. To overcome this, we cast the problem as a submodular flow (SF) problem in an auxiliary graph in such a way that applying most existing SF algorithms would rely only on these subroutines. We then explore in more detail Iwata's capacity scaling approach for submodular flows (Iwata 1997 [19]). In particular, we show how to improve its complexity in the case when the function contains cardinality-dependent terms.","lang":"eng"}],"month":"10","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","issue":"15","doi":"10.1016/j.dam.2012.05.025","author":[{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3582","date_updated":"2021-01-12T07:41:11Z","day":"01","intvolume":"       160"}