Online algorithms for submodular minimization with combinatorial constraints

Stefanie Jegelka, Jeffrey A. BilmesMPG.PuRe 2010

Abstract

Building on recent results for submodular minimization with combinatorial constraints, and on online submodular minimization, we address online approximation algorithms for submodular minimization with combinatorial constraints. We discuss two types of algorithms and outline approximation algorithms that integrate into those.
BibTeX
@inproceedings{jegelka2010online,
  author = {Stefanie Jegelka and Jeffrey A. Bilmes},
  title = {{Online algorithms for submodular minimization with combinatorial constraints}},
  booktitle = {MPG.PuRe},
  year = {2010},
}

Loading related content...

Figure