Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover

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

doi:10.1137/21M1428649

Local TagsRelease HistoryDetailsSummary

Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000E-36CD-F Version Permalink: https://hdl.handle.net/21.11116/0000-000E-36CE-E

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Bhattacharya, Sayan¹, Author
Henzinger, Monika¹, Author
Nanongkai, Danupon², Author
Wu, Xiaowei¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2023Date issued: 2023

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1137/21M1428649
BibTex Citekey: Bhattacharya23

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: SIAM Journal on Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Philadelphia : SIAM.

Pages: - Volume / Issue: 52 (5) Sequence Number: - Start / End Page: 1132 - 1192 Identifier: ISSN: 0097-5397
CoNE: https://pure.mpg.de/cone/journals/resource/954925466249