46 search results - page 5 / 10 » Maximizing Non-Monotone Submodular Functions |
WINE
2005
Springer
15 years 5 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
111
click to vote
SPAA
2010
ACM
14 years 11 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
105
Voted
WSDM
2012
ACM
13 years 7 months ago
2012
ACM
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
122
Voted
WINE
2010
Springer
14 years 9 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
115
Voted
KDD
2012
ACM
13 years 2 months ago
2012
ACM
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...