Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover

Bhattacharya, Sayan; Henzinger, Monika; Nanongkai, Danupon; Wu, Xiaowei

doi:10.1137/21M1428649

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover

MPS-Authors

/persons/resource/persons45102

Nanongkai, Danupon
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bhattacharya, S., Henzinger, M., Nanongkai, D., & Wu, X. (2023). Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover. SIAM Journal on Computing, 52(5), 1132-1192. doi:10.1137/21M1428649.

Cite as: https://hdl.handle.net/21.11116/0000-000E-36CD-F

Abstract

There is no abstract available