en-de
en-es
en-fr
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
Online submodular minimization with combinatorial constraints
Published on 2011-01-136591 Views
Recently, there has been rising interest in replacing the linear (modular) cost function in combinatorial problems by a submodular cost function. This enhancement opens the door for powerful models