# Fully-Dynamic Submodular Cover with Bounded Recourse

@article{Gupta2020FullyDynamicSC, title={Fully-Dynamic Submodular Cover with Bounded Recourse}, author={A. Gupta and Roie Levin}, journal={ArXiv}, year={2020}, volume={abs/2009.00800} }

In submodular covering problems, we are given a monotone, nonnegative submodular function f : 2 → R+ and wish to find the min-cost set S ⊆ N such that f(S) = f(N ). When f is a coverage function, this captures SetCover as a special case. 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 (a.k.a. recourse) is allowed. For concreteness, suppose a nonnegative monotone… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 71 REFERENCES

An analysis of the greedy algorithm for the submodular set covering problem

- Mathematics, Computer Science
- 1982

- 436
- PDF

Learning with Submodular Functions: A Convex Optimization Perspective

- Computer Science, Mathematics
- 2013

- 292
- PDF

Approximation Algorithms for the Set Covering and Vertex Cover Problems

- Mathematics, Computer Science
- 1982

- 463