Sciweavers

46 search results - page 2 / 10
» Maximizing Non-Monotone Submodular Functions
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 1 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 4 months ago
Improved Inapproximability For Submodular Maximization
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a ...
Per Austrin
TOC
2010
127views Management» more  TOC 2010»
12 years 12 months ago
The Submodular Welfare Problem with Demand Queries
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
Uriel Feige, Jan Vondrák
JMLR
2012
11 years 7 months ago
On Bisubmodular Maximization
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
Ajit Singh, Andrew Guillory, Jeff Bilmes
CORR
2011
Springer
168views Education» more  CORR 2011»
12 years 11 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe