Fully-Dynamic Submodular Cover with Bounded Recourse

09/02/2020
by   Anupam Gupta, et al.
0

In submodular covering problems, we are given a monotone, nonnegative submodular function f: 2^N →ℝ_+ and wish to find the min-cost set S⊆ N such that f(S)=f(N). This captures SetCover when f is a coverage function. We introduce a general framework for solving such problems in a fully-dynamic setting where the function f changes over time, and only a bounded number of updates to the solution (recourse) is allowed. For concreteness, suppose a nonnegative monotone submodular function g_t is added or removed from an active set G^(t) at each time t. If f^(t)=∑_g∈ G^(t) g is the sum of all active functions, we wish to maintain a competitive solution to SubmodularCover for f^(t) as this active set changes, and with low recourse. We give an algorithm that maintains an O(log(f_max/f_min))-competitive solution, where f_max, f_min are the largest/smallest marginals of f^(t). The algorithm guarantees a total recourse of O(log(c_max/ c_min)·∑_t≤ Tg_t(N)), where c_max,c_min are the largest/smallest costs of elements in N. This competitive ratio is best possible even in the offline setting, and the recourse bound is optimal up to the logarithmic factor. For monotone submodular functions that also have positive mixed third derivatives, we show an optimal recourse bound of O(∑_t≤ Tg_t(N)). This structured class includes set-coverage functions, so our algorithm matches the known O(log n)-competitiveness and O(1) recourse guarantees for fully-dynamic SetCover. Our work simultaneously simplifies and unifies previous results, as well as generalizes to a significantly larger class of covering problems. Our key technique is a new potential function inspired by Tsallis entropy. We also extensively use the idea of Mutual Coverage, which generalizes the classic notion of mutual information.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2020

Fully Dynamic Algorithm for Constrained Submodular Optimization

The task of maximizing a monotone submodular function under a cardinalit...
research
05/24/2023

Supermodular Rank: Set Function Decomposition and Optimization

We define the supermodular rank of a function on a lattice. This is the ...
research
05/24/2023

Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time

Maximizing a monotone submodular function under cardinality constraint k...
research
05/31/2023

Fully Dynamic Submodular Maximization over Matroids

Maximizing monotone submodular functions under a matroid constraint is a...
research
11/12/2021

Random Order Set Cover is as Easy as Offline

We give a polynomial-time algorithm for OnlineSetCover with a competitiv...
research
04/04/2023

Chasing Positive Bodies

We study the problem of chasing positive bodies in ℓ_1: given a sequence...
research
06/22/2022

Misinformation Mitigation under Differential Propagation Rates and Temporal Penalties

We propose an information propagation model that captures important temp...

Please sign up or login with your details

Forgot password? Click here to reset