Online submodular minimization with combinatorial constraints
Published on Jan 13, 20116579 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