{"status":"public","publist_id":"3806","type":"conference","department":[{"_id":"VlKo"}],"page":"451 - 462","citation":{"ieee":"A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.","mla":"Huber, Anna, and Vladimir Kolmogorov. <i>Towards Minimizing K-Submodular Functions</i>. Vol. 7422, Springer, 2012, pp. 451–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>.","ama":"Huber A, Kolmogorov V. Towards minimizing k-submodular functions. In: Vol 7422. Springer; 2012:451-462. doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>","ista":"Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO: International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462.","apa":"Huber, A., &#38; Kolmogorov, V. (2012). Towards minimizing k-submodular functions (Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>","short":"A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.","chicago":"Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular Functions,” 7422:451–62. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>."},"alternative_title":["LNCS"],"scopus_import":1,"volume":7422,"oa":1,"_id":"2930","doi":"10.1007/978-3-642-32147-4_40","day":"01","author":[{"last_name":"Huber","full_name":"Huber, Anna","first_name":"Anna"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"}],"month":"04","oa_version":"Preprint","acknowledgement":"We would like to thank Andrei Krokhin for encourag- ing our cooperation, for helpful discussions, and for his critical reading of the manuscript.\r\n","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5469"}],"year":"2012","date_published":"2012-04-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:24Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:00:46Z","quality_controlled":"1","conference":{"location":"Athens, Greece","name":"ISCO: International Symposium on Combinatorial Optimization","start_date":"2012-04-19","end_date":"2012-04-21"},"abstract":[{"text":"In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.\r\n\r\nIn particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron, prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm to construct the vertices of the polyhedron.\r\n","lang":"eng"}],"title":"Towards minimizing k-submodular functions","publisher":"Springer","intvolume":"      7422","publication_status":"published"}