Sciweavers

CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 4 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
FOCS
2009
IEEE
13 years 11 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák