{"conference":{"name":"MFCS: Mathematical Foundations of Computer Science"},"date_created":"2018-12-11T12:02:00Z","date_updated":"2021-01-12T07:41:47Z","month":"08","publisher":"Springer","title":"Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions","status":"public","doi":"10.1007/978-3-642-22993-0_37","page":"400 - 411","alternative_title":["LNCS"],"publication_status":"published","day":"09","main_file_link":[{"url":"http://arxiv.org/pdf/1007.1229v3","open_access":"0"}],"year":"2011","volume":6907,"quality_controlled":0,"date_published":"2011-08-09T00:00:00Z","intvolume":"      6907","extern":1,"publist_id":"3478","citation":{"apa":"Kolmogorov, V. (2011). Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions (Vol. 6907, pp. 400–411). Presented at the MFCS: Mathematical Foundations of Computer Science, Springer. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">https://doi.org/10.1007/978-3-642-22993-0_37</a>","chicago":"Kolmogorov, Vladimir. “Submodularity on a Tree: Unifying Submodularity on a Tree: Unifying L-Convex and Bisubmodular Functions Convex and Bisubmodular Functions,” 6907:400–411. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">https://doi.org/10.1007/978-3-642-22993-0_37</a>.","ama":"Kolmogorov V. Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions. In: Vol 6907. Springer; 2011:400-411. doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">10.1007/978-3-642-22993-0_37</a>","ista":"Kolmogorov V. 2011. Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 400–411.","ieee":"V. Kolmogorov, “Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions,” presented at the MFCS: Mathematical Foundations of Computer Science, 2011, vol. 6907, pp. 400–411.","mla":"Kolmogorov, Vladimir. <i>Submodularity on a Tree: Unifying Submodularity on a Tree: Unifying L-Convex and Bisubmodular Functions Convex and Bisubmodular Functions</i>. Vol. 6907, Springer, 2011, pp. 400–11, doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">10.1007/978-3-642-22993-0_37</a>.","short":"V. Kolmogorov, in:, Springer, 2011, pp. 400–411."},"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir"}],"abstract":[{"lang":"eng","text":"We introduce a new class of functions that can be minimized in polynomial time in the value oracle model. These are functions f satisfying f(x) + f(y) ≥ f(x ∏ y) + f(x ∐ y) where the domain of each variable x i corresponds to nodes of a rooted binary tree, and operations ∏,∐ are defined with respect to this tree. Special cases include previously studied L-convex and bisubmodular functions, which can be obtained with particular choices of trees. We present a polynomial-time algorithm for minimizing functions in the new class. It combines Murota's steepest descent algorithm for L-convex functions with bisubmodular minimization algorithms. "}],"type":"conference","_id":"3204"}