Online submodular minimization with combinatorial constraints
published: Jan. 13, 2011, recorded: December 2010, views: 1009
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !