Dynamic Set Cover: Improved Amortized and Worst-Case Update Time

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

doi:10.1137/1.9781611976465.150

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Dynamic Set Cover: Improved Amortized and Worst-Case Update Time

MPS-Authors

There are no MPG-Authors in the publication available

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. (2021). Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. In D. Marx (Ed.), Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (pp. 2537-2549). Philadelphia, PA: SIAM. doi:10.1137/1.9781611976465.150.

Cite as: https://hdl.handle.net/21.11116/0000-000E-6B5A-6

Abstract

There is no abstract available