3 papers
cs.DS2026
Engineering Algorithms for Dynamic Greedy Set Cover
Amitai Uzrad
In the dynamic set cover problem, the input is a dynamic universe of elements and a fixed collection of sets. As elements are inserted or deleted, the goal is to efficiently mainta…
cs.DS2025
Dynamic Set Cover with Worst-Case Recourse
Shay Solomon, Amitai Uzrad
In the dynamic set cover (SC) problem, the input is a dynamic universe of at most elements and a fixed collection of sets, where each element belongs to at most sets an…
cs.DS2024
A Lossless Deamortization for Dynamic Greedy Set Cover
Shay Solomon, Amitai Uzrad, Tianyi Zhang
The dynamic set cover problem has been subject to growing research attention in recent years. In this problem, we are given as input a dynamic universe of at most elements and…