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.

Cited by: 2|Bibtex|Views37|
EI
Keywords:
data structuresdynamic algorithmsset covermatching

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments