当前位置:
X-MOL 学术
›
J. Comb. Optim.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A short proof for stronger version of DS decomposition in set function optimization
Journal of Combinatorial Optimization ( IF 1 ) Pub Date : 2020-08-19 , DOI: 10.1007/s10878-020-00639-4 Xiang Li , H. George Du
中文翻译:
集函数优化中DS分解的更强版本的简短证明
更新日期:2020-08-20
Journal of Combinatorial Optimization ( IF 1 ) Pub Date : 2020-08-19 , DOI: 10.1007/s10878-020-00639-4 Xiang Li , H. George Du
Using a short proof, we show that every set function f can be decomposed into the difference of two monotone increasing and strictly submodular functions g and h, i.e., \(f=g-h\), and every set function f can also be decomposed into the difference of two monotone increasing and strictly supermodular functions g and h, i.e., \(f=g-h\).
中文翻译:
集函数优化中DS分解的更强版本的简短证明
使用一个简短的证明,我们表明每个集合函数f都可以分解为两个单调递增函数和严格的子模函数g和h的差,即\(f = gh \),每个集合函数f也可以分解为两个单调递增函数和严格的超模函数g和h之差,即\(f = gh \)。