The Library
Dynamic set cover : improved amortized and worst-case update time
Tools
Bhattacharya, Sayan, Henzinger, Monika, Nanongkai, Danupon and Wu, Xiaowei (2021) Dynamic set cover : improved amortized and worst-case update time. In: ACM-SIAM Symposium on Discrete Algorithms (SODA21), Virtual, 10-13 Jan 2021. Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) pp. 2537-2549. ISBN 9781611976465. doi:10.1137/1.9781611976465.150
|
PDF
WRAP-dynamic-set-cover-improved-amortized-worst-case-update-time-Bhattacharya-2021.pdf - Accepted Version - Requires a PDF viewer. Download (994Kb) | Preview |
Official URL: https://doi.org/10.1137/1.9781611976465.150
Abstract
In the dynamic minimum set cover problem, a challenge is to minimize the update time while guaranteeing close to the optimal min(O(log n), f) approximation factor. (Throughout, m, n, f, and C are parameters denoting the maximum number of sets, number of elements, frequency, and the cost range.) In the high-frequency range, when f = Ω(log n), this was achieved by a deterministic O(log n)-approximation algorithm with O(f log n) amortized update time [Gupta et al. STOC'17]. In the low-frequency range, the line of work by Gupta et al. [STOC'17], Abboud et al. [STOC'19], and Bhattacharya et al. [ICALP'15, IPCO'17, FOCS'19] led to a deterministic (1 + ∊) f-approximation algorithm with O(f log(Cn)/∊2) amortized update time. In this paper we improve the latter update time and provide the first bounds that subsume (and sometimes improve) the state-of-the-art dynamic vertex cover algorithms. We obtain: (1) (1 + ∊) f-approximation ratio in O(f log2(Cn)/∊3) worst-case update time: No non-trivial worst-case update time was previously known for dynamic set cover. Our bound subsumes and improves by a logarithmic factor the O(log3 n/poly(∊)) worst-case update time for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1) by Bhattacharya et al. [SODA'17]. (2) (1 + ∊) f-approximation ratio in O ((f2/∊3) + (f/∊2) log C) amortized update time: This result improves the previous O(f log (Cn)/∊2) update time bound for most values of f in the low-frequency range, i.e. whenever f = o(log n). It is the first that is independent of m and n. It subsumes the constant amortized update time of Bhattacharya and Kulkarni [SODA'19] for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1). These results are achieved by leveraging the approximate complementary slackness and background schedulers techniques. These techniques were used in the local update scheme for dynamic vertex cover. Our main technical contribution is to adapt these techniques within the global update scheme of Bhattacharya et al. [FOCS'19] for the dynamic set cover problem.
Item Type: | Conference Item (Paper) | ||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Alternative Title: | |||||||||||||||||||||||||
Subjects: | Q Science > QA Mathematics | ||||||||||||||||||||||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||||||||||||||||||||||
Library of Congress Subject Headings (LCSH): | Approximation theory, Computer algorithms, Dynamics | ||||||||||||||||||||||||
Journal or Publication Title: | Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) | ||||||||||||||||||||||||
Publisher: | Society for Industrial and Applied Mathematics | ||||||||||||||||||||||||
ISBN: | 9781611976465 | ||||||||||||||||||||||||
Official Date: | 2021 | ||||||||||||||||||||||||
Dates: |
|
||||||||||||||||||||||||
Page Range: | pp. 2537-2549 | ||||||||||||||||||||||||
DOI: | 10.1137/1.9781611976465.150 | ||||||||||||||||||||||||
Status: | Peer Reviewed | ||||||||||||||||||||||||
Publication Status: | Published | ||||||||||||||||||||||||
Reuse Statement (publisher, data, author rights): | “First Published in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) in published by the Society for Industrial and Applied Mathematics (SIAM)” and the copyright notice as stated in the article itself (e.g., “Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.”) | ||||||||||||||||||||||||
Access rights to Published version: | Restricted or Subscription Access | ||||||||||||||||||||||||
Date of first compliant deposit: | 28 November 2019 | ||||||||||||||||||||||||
Date of first compliant Open Access: | 2 December 2019 | ||||||||||||||||||||||||
RIOXX Funder/Project Grant: |
|
||||||||||||||||||||||||
Conference Paper Type: | Paper | ||||||||||||||||||||||||
Title of Event: | ACM-SIAM Symposium on Discrete Algorithms (SODA21) | ||||||||||||||||||||||||
Type of Event: | Conference | ||||||||||||||||||||||||
Location of Event: | Virtual | ||||||||||||||||||||||||
Date(s) of Event: | 10-13 Jan 2021 | ||||||||||||||||||||||||
Related URLs: | |||||||||||||||||||||||||
Open Access Version: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year