A New Deterministic Algorithm for Dynamic Set Cover

We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^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 se...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 406 - 423
Main Authors:	Bhattacharya, Sayan, Henzinger, Monika, Nanongkai, Danupon
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2019
Subjects:	Approximation algorithms Computer science Data structures dynamic algorithms Dynamics Heuristic algorithms matching Optimization set cover
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!