Sciweavers

36 search results - page 1 / 8
» Symmetry and Approximability of Submodular Maximization Prob...
Sort
View
FOCS
2009
IEEE
15 years 5 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
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 26 days ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
FOCS
2007
IEEE
15 years 4 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
CORR
2010
Springer
111views Education» more  CORR 2010»
14 years 10 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
NAACL
2010
14 years 8 months ago
Multi-document Summarization via Budgeted Maximization of Submodular Functions
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
Hui Lin, Jeff Bilmes