Structured Convex Optimization under Submodular Constraints. | 6 | 0.43 | 2013 |
Online prediction under submodular constraints | 12 | 0.69 | 2012 |
Submodular fractional programming for balanced clustering | 5 | 0.51 | 2011 |
Size-constrained Submodular Minimization through Minimum Norm Base. | 17 | 0.77 | 2011 |
Minimum Average Cost Clustering. | 19 | 0.92 | 2010 |
Submodularity Cuts and Applications. | 9 | 0.81 | 2009 |
A Structure Theory for the Parametric Submodular Intersection Problem | 0 | 0.34 | 2009 |
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints | 2 | 0.37 | 2009 |
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization | 15 | 0.92 | 2007 |
A strongly polynomial algorithm for line search in submodular polyhedra | 6 | 0.53 | 2007 |
On Convex Minimization over Base Polytopes | 8 | 0.80 | 2007 |