Online algorithms for submodular minimization with combinatorial constraints
2010
Conference Paper
ei
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.
Author(s): | Jegelka, S. and Bilmes, J. |
Pages: | 1-6 |
Year: | 2010 |
Month: | December |
Day: | 0 |
Department(s): | Empirical Inference |
Bibtex Type: | Conference Paper (inproceedings) |
Event Name: | NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML) |
Event Place: | Whistler, BC, Canada |
Digital: | 0 |
Links: |
PDF
Web |
BibTex @inproceedings{JegelkaB2010, title = {Online algorithms for submodular minimization with combinatorial constraints}, author = {Jegelka, S. and Bilmes, J.}, pages = {1-6}, month = dec, year = {2010}, doi = {}, month_numeric = {12} } |