Fetching the paper…
Reading the bibliography…
Motivated by applications in online advertising, we consider a class of maximization problems where the objective is a function of the sequence of actions as well as the running duration of each action.
Best algorithms for approximating the maximum of a submodular set function
George L Nemhauser and Laurence A Wolsey · 1978
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher · 1978
Earlier work this paper cites.
Maximising real-valued submodular functions: Primal and dual heuristics for location problems
Laurence A Wolsey · 1982
Earlier work this paper cites.
An optimal algorithm for on-line bipartite matching
Richard M Karp, Umesh V Vazirani, and Vijay V Vazirani · 1990
Earlier work this paper cites.
Maximizing the spread of influence through a social network
David Kempe, Jon Kleinberg, and Éva Tardos · 2003
Earlier work this paper cites.
Auctions with budget constraints
Nir Andelman and Yishay Mansour · 2004
Earlier work this paper cites.
Inapproximability results for combinatorial auctions with submodular utility functions
Subhash Khot, Richard J Lipton, Evangelos Markakis, and Aranyak Mehta · 2005
Earlier work this paper cites.
An improved approximation algorithm for combinatorial auctions with submodular bidders
Shahar Dobzinski and Michael Schapira · 2006
Earlier work this paper cites.
Tight approximation algorithms for maximum general assignment problems
Lisa Fleischer, Michel X Goemans, Vahab S Mirrokni, and Maxim Sviridenko · 2006
Earlier work this paper cites.
Generating query substitutions
Rosie Jones, Benjamin Rey, Omid Madani, and Wiley Greiner · 2006
Earlier work this paper cites.
Combinatorial auctions with decreasing marginal utilities
Benny Lehmann, Daniel Lehmann, and Noam Nisan · 2006
Earlier work this paper cites.
Revisiting the greedy approach to submodular set function maximization
Pranava R Goundan and Andreas S Schulz · 2007
Cited alongside, same era.
Algorithmic game theory, chapter sponsored search, 2007
S Lahaie, D Pennock, A Saberi, and R Vohra · 2007
Cited alongside, same era.
Adwords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani · 2007
Cited alongside, same era.
Comparing click logs and editorial labels for training query rewriting
Wei Vivian Zhang and Rosie Jones · 2007
Cited alongside, same era.
Online budgeted matching in random input models with applications to adwords
Gagan Goel and Aranyak Mehta · 2008
Cited alongside, same era.
Optimizing query rewrites for keyword-based advertising
Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, and Grant Wang · 2008
A class of submodular functions for document summarization
Hui Lin and Jeff Bilmes · 2011
Closest in time.
Rewriting null e-commerce queries to recommend products
Gyanit Singh, Nish Parikh, and Neel Sundaresan · 2012
Closest in time.
Adaptive submodular maximization in bandit setting
Victor Gabillon, Branislav Kveton, Zheng Wen, Brian Eriksson, and S Muthukrishnan · 2013
Closest in time.
Online matching and ad allocation
Aranyak Mehta · 2013
Closest in time.
Near-optimally teaching the crowd to classify
Adish Singla, Ilija Bogunovic, Gábor Bartók, Amin Karbasi, and Andreas Krause · 2014
Closest in time.
Maximizing stochastic monotone submodular functions
Arash Asadpour and Hamid Nazerzadeh · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Optimal approximation for the submodular welfare problem in the value oracle model
Jan Vondrák · 2008
Cited alongside, same era.
On maximizing welfare when utility functions are subadditive
Uriel Feige · 2009
Cited alongside, same era.
Submodularity of influence in social networks: From local to global
Elchanan Mossel and Sebastien Roch · 2010
Cited alongside, same era.
Maximizing non-monotone submodular functions
Uriel Feige, Vahab S Mirrokni, and Jan Vondrak · 2011
Cited alongside, same era.
Adaptive submodularity: Theory and applications in active learning and stochastic optimization
Daniel Golovin and Andreas Krause · 2011
Cited alongside, same era.
Marek Adamczyk, Maxim Sviridenko, and Justin Ward · 2016
Closest in time.
Distributed submodular maximization
Baharan Mirzasoleiman, Amin Karbasi, Rik Sarkar, and Andreas Krause · 2016
Closest in time.
Inhomogeneous hypergraph clustering with applications
Pan Li and Olgica Milenkovic · 2017
Closest in time.
Selecting sequences of items via submodular maximization
Sebastian Tschiatschek, Adish Singla, and Andreas Krause · 2017
Closest in time.
Submodularity on hypergraphs: From sets to sequences
Marko Mitrovic, Moran Feldman, Andreas Krause, and Amin Karbasi · 2018
Closest in time.