A New Deterministic Algorithm for Dynamic Set Cover
2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), pp. 406.0-423, 2019.
data structuresdynamic algorithmsset covermatching
We present a deterministic dynamic algorithm for maintaining a (1 + epsilon) f-approximate minimum cost set cover with O(f log(Cn)/epsilon(2)) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each...More
PPT (Upload PPT)