Online submodular minimization with combinatorial constraints thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Online submodular minimization with combinatorial constraints

Published on Jan 13, 20116584 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

Related categories