Online Submodular Maximization with Preemption

Submodular function maximization has been studied extensively in recent years under various constraints and models. The problem plays a major role in various disciplines. We study a natural online variant of this problem in which elements arrive one-by-one and the algorithm has to maintain a solution obeying certain constraints at all times. Upon arrival of an element, the algorithm has to decide whether to accept the element into its solution and may preempt previously chosen elements. The goal is to maximize a submodular function over the set of elements in the solution. We study two special cases of this general problem and derive upper and lower bounds on the competitive ratio. Specifically, we design a 1/e-competitive algorithm for the unconstrained case in which the algorithm may hold any subset of the elements, and constant competitive ratio algorithms for the case where the algorithm may hold at most k elements in its solution.

[1]  G. Nemhauser,et al.  On the Uncapacitated Location Problem , 1977 .

[2]  Sanjeev Khanna,et al.  A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 2005, SIAM J. Comput..

[3]  Amit Chakrabarti,et al.  Submodular maximization meets streaming: matchings, matroids, and more , 2013, Math. Program..

[4]  Aaron Roth,et al.  Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms , 2010, WINE.

[5]  Uri Zwick,et al.  Combinatorial approximation algorithms for the maximum directed cut problem , 2001, SODA '01.

[6]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[7]  Jan Vondrák,et al.  Symmetry and Approximability of Submodular Maximization Problems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[8]  Uri Zwick,et al.  Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems , 2002, IPCO.

[9]  Yossi Azar,et al.  Submodular Max-SAT , 2011, ESA.

[10]  Morteza Zadimoghaddam,et al.  Submodular secretary problem and extensions , 2013, TALG.

[11]  Vahab S. Mirrokni,et al.  Tight approximation algorithms for maximum general assignment problems , 2006, SODA '06.

[12]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[13]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[14]  Laurence A. Wolsey,et al.  Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..

[15]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[16]  Amotz Bar-Noy,et al.  Online maximum directed cut , 2012, J. Comb. Optim..

[17]  Uriel Feige,et al.  Oblivious Algorithms for the Maximum Directed Cut Problem , 2013, Algorithmica.

[18]  Robert D. Kleinberg,et al.  Selling Banner Ads: Online Algorithms with Buyback , 2008 .

[19]  Maxim Sviridenko,et al.  An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem , 1999, Discret. Appl. Math..

[20]  Tomomi Matsui,et al.  0.863-Approximation Algorithm for MAX DICUT , 2001 .

[21]  Yossi Azar,et al.  Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms , 1999, SODA '99.

[22]  Joseph Naor,et al.  Submodular Maximization with Cardinality Constraints , 2014, SODA.

[23]  Matthias Englert,et al.  Lower and Upper Bounds on FIFO Buffer Management in QoS Switches , 2006, Algorithmica.

[24]  Jan Vondrák,et al.  Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

[25]  Reuven Cohen,et al.  An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..

[26]  Andreas Krause,et al.  Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.

[27]  Hui Lin,et al.  Multi-document Summarization via Budgeted Maximization of Submodular Functions , 2010, NAACL.

[28]  Hui Lin,et al.  A Class of Submodular Functions for Document Summarization , 2011, ACL.

[29]  Leah Epstein,et al.  Improved Bounds for Online Preemptive Matching , 2012, STACS.

[30]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[31]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[32]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[33]  Tomomi Matsui,et al.  63-Approximation Algorithm for MAX DICUT , 2001, RANDOM-APPROX.

[34]  Andreas Krause,et al.  Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks , 2008 .

[35]  Andreas Krause,et al.  Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.

[36]  Jon Feldman,et al.  An online mechanism for ad slot reservations with cancellations , 2009, SODA.

[37]  Allan Borodin,et al.  Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization , 2013, ISAAC.

[38]  Stanley P. Y. Fung.  Online scheduling with preemption or non-completion penalties , 2014, J. Sched..

[39]  Ashwinkumar Badanidiyuru Varadaraja.  Buyback problem: approximate matroid intersection with cancellation costs , 2011, ICALP 2011.

[40]  Joseph Naor,et al.  Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract) , 2011, ICALP.

[41]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[42]  Uriel Feige,et al.  Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[43]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[44]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[45]  Joseph Naor,et al.  A Unified Continuous Greedy Algorithm for Submodular Maximization , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[46]  Jan Vondrák,et al.  Submodular maximization by simulated annealing , 2010, SODA '11.

[47]  Joseph Naor,et al.  A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[48]  Luca Trevisan,et al.  Gadgets, Approximation, and Linear Programming , 2000, SIAM J. Comput..

[49]  Kazuo Iwama,et al.  Removable Online Knapsack Problems , 2002, ICALP.

[50]  Roy Schwartz,et al.  Improved competitive ratios for submodular secretary problems , 2011 .

[51]  Moshe Babaioff,et al.  Selling ad campaigns: online algorithms with cancellations , 2009, EC '09.

[52]  Tim Roughgarden,et al.  Revenue submodularity , 2009, EC '09.

[53]  Robert D. Kleinberg,et al.  Randomized Online Algorithms for the Buyback Problem , 2009, WINE.

[54]  Andreas S. Schulz,et al.  Approximating the least core value and least core of cooperative games with supermodular costs , 2013, Discret. Optim..

[55]  Kazuhisa Makino,et al.  Online Unweighted Knapsack Problem with Removal Cost , 2013, Algorithmica.

[56]  Ashwinkumar Badanidiyuru,et al.  Buyback Problem - Approximate Matroid Intersection with Cancellation Costs , 2010, ICALP.

[57]  Vahab S. Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).