A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Fully-Dynamic Submodular Cover with Bounded Recourse
[article]

2020
*
arXiv
*
pre-print

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

arXiv:2009.00800v1
fatcat:4vznx6vtynbdbmjgwuejwbcfmu