Online submodular minimization with combinatorial constraints
Online submodular minimization with combinatorial constraints
Jan 13, 2011 6618 views 
en-de
en-es
en-fr
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
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, but at the same time leads to very hard optimization problems. Building on recent progress in submodular minimization with combinatorial constraints, and in online submodular minimization, this talk outlines routes for approximate online submodular minimization with combinatorial constraints. We address this scenario using the example of Minimum Cooperative Cut”, whose modular analogue, Minimum Cut, has been important in many applications.