Corpus ID: 221446612

Fully-Dynamic Submodular Cover with Bounded Recourse

  title={Fully-Dynamic Submodular Cover with Bounded Recourse},
  author={A. Gupta and Roie Levin},
  • A. Gupta, Roie Levin
  • Published 2020
  • Computer Science
  • ArXiv
  • 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

    Figures from this paper.


    Publications referenced by this paper.
    Possible generalization of Boltzmann-Gibbs statistics
    • 6,023
    • PDF
    An analysis of the greedy algorithm for the submodular set covering problem
    • 436
    • PDF
    Learning with Submodular Functions: A Convex Optimization Perspective
    • 292
    • PDF
    Dynamic Steiner Tree Problem
    • 357
    • PDF
    Approximation Algorithms for the Set Covering and Vertex Cover Problems
    • 463
    Analytical approach to parallel repetition
    • 297
    • PDF
    Online and dynamic algorithms for set cover
    • 43
    • PDF