skip to main content
10.1145/3313276.3316376acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Dynamic set cover: improved algorithms and lower bounds

Published: 23 June 2019 Publication History

Abstract

We give new upper and lower bounds for the dynamic set cover problem. First, we give a (1+є) f-approximation for fully dynamic set cover in O(f2logn5) (amortized) update time, for any є > 0, where f is the maximum number of sets that an element belongs to. In the decremental setting, the update time can be improved to O(f25), while still obtaining an (1+є) f-approximation. These are the first algorithms that obtain an approximation factor linear in f for dynamic set cover, thereby almost matching the best bounds known in the offline setting and improving upon the previous best approximation of O(f2) in the dynamic setting.
To complement our upper bounds, we also show that a linear dependence of the update time on f is necessary unless we can tolerate much worse approximation factors. Using the recent distributed PCP-framework, we show that any dynamic set cover algorithm that has an amortized update time of O(f1−є) must have an approximation factor that is Ω(nδ) for some constant δ>0 under the Strong Exponential Time Hypothesis.

References

[1]
Amir Abboud, Aviad Rubinstein, and R. Ryan Williams. 2017. Distributed PCP Theorems for Hardness of Approximation in P. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. 25–36.
[2]
Amir Abboud and Virginia Vassilevska Williams. 2014. Popular conjectures imply strong lower bounds for dynamic problems. In Foundations of Computer Science (FOCS). 434–443.
[3]
Amir Abboud, Virginia Vassilevska Williams, and Huacheng Yu. 2018. Matching triangles and basing hardness on an extremely popular conjecture. SIAM J. Comput. 47, 3 (2018), 1098–1122.
[4]
Ittai Abraham, Shiri Chechik, and Sebastian Krinninger. 2017.
[5]
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 440–452.
[6]
Ittai Abraham, Shiri Chechik, and Sebastian Krinninger. 2017.
[7]
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 440–452.
[8]
Sepehr Assadi and Sanjeev Khanna. 2018. Tight bounds on the round complexity of the distributed maximum coverage problem. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2412–2431.
[9]
Sepehr Assadi, Krzysztof Onak, Baruch Schieber, and Shay Solomon. 2018. Fully dynamic maximal independent set with sublinear update time. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. ACM, 815–826.
[10]
Surender Baswana, Manoj Gupta, and Sandeep Sen. 2015. Fully Dynamic Maximal Matching in O (log n) Update Time. SIAM J. Comput. 44, 1 (2015), 88–113.
[11]
Aaron Bernstein and Cliff Stein. 2016. Faster fully dynamic matchings with small approximation ratios. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 692–711.
[12]
Sayan Bhattacharya, Deeparnab Chakrabarty, and Monika Henzinger. 2017. Deterministic fully dynamic approximate vertex cover and fractional matching in O (1) amortized update time. In International Conference on Integer Programming and Combinatorial Optimization. Springer, 86–98.
[13]
Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, and Danupon Nanongkai. 2018.
[14]
Dynamic Algorithms for Graph Coloring. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1–20.
[15]
Sayan Bhattacharya, Monika Henzinger, and Giuseppe F Italiano. 2015. Design of dynamic algorithms via primal-dual method. In International Colloquium on Automata, Languages, and Programming. Springer, 206–218.
[16]
Sayan Bhattacharya, Monika Henzinger, and Giuseppe F Italiano. 2015. Deterministic fully dynamic data structures for vertex cover and matching. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 785–804.
[17]
Sayan Bhattacharya, Monika Henzinger, and Danupon Nanongkai. 2016. New deterministic approximation algorithms for fully dynamic matching. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. ACM, 398–411.
[18]
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, and Nikos Parotsidis. 2016.
[19]
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m √ n) Total Update Time. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. 315–324.
[20]
Lijie Chen. 2018.
[21]
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. In 33rd Computational Complexity Conference, CCC 2018, June 22-24, 2018, San Diego, CA, USA. 14:1–14:45.
[22]
Camil Demetrescu and Giuseppe F. Italiano. 2004. A New Approach to Dynamic All Pairs Shortest Paths. J. ACM 51, 6 (Nov. 2004), 968–992.
[23]
Irit Dinur and David Steurer. 2014. Analytical approach to parallel repetition. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing. ACM, 624–633.
[24]
Greg N Frederickson. 1985. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14, 4 (1985), 781–798.
[25]
Michael L. Fredman, János Komlós, and Endre Szemerédi. 1984. Storing a Sparse Table with 0(1) Worst Case Access Time. J. ACM 31, 3 (1984), 538–544.
[26]
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, and Debmalya Panigrahi. 2017. Online and dynamic algorithms for set cover. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. ACM, 537–550.
[27]
Manoj Gupta and Richard Peng. 2013. Fully dynamic (1+ e)-approximate matchings. In Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on. IEEE, 548–557.
[28]
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. 2015. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015. 21–30.
[29]
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. 2015. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the fortyseventh annual ACM symposium on Theory of computing. ACM, 21–30.
[30]
Monika R Henzinger and Valerie King. 1999. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM (JACM) 46, 4 (1999), 502–516.
[31]
Jacob Holm, Kristian De Lichtenberg, and Mikkel Thorup. 2001. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM (JACM) 48, 4 (2001), 723–760.
[32]
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan Ullman, Ali Vakilian, and Anak Yodpinyanee. 2017. Fractional set cover in the streaming model. In LIPIcs-Leibniz International Proceedings in Informatics, Vol. 81. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[33]
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, and Piotr Sankowski. 2017.
[34]
Decremental single-source reachability in planar digraphs. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. 1108–1121.
[35]
Subhash Khot and Oded Regev. 2008. Vertex cover might be hard to approximate to within 2- ε. J. Comput. System Sci. 74, 3 (2008), 335–349.
[36]
Tsvi Kopelowitz, Seth Pettie, and Ely Porat. 2016. Higher Lower Bounds from the 3SUM Conjecture. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. 1272–1287.
[37]
Andrew McGregor and Hoa T Vu. 2016.
[38]
Better streaming algorithms for the maximum coverage problem. arXiv preprint arXiv:1610.06199 (2016).
[39]
Ofer Neiman and Shay Solomon. 2016. Simple deterministic algorithms for fully dynamic maximal matching. ACM Transactions on Algorithms (TALG) 12, 1 (2016), 7.
[40]
Krzysztof Onak and Ronitt Rubinfeld. 2010. Maintaining a large matching and a small vertex cover. In Proceedings of the forty-second ACM symposium on Theory of computing. ACM, 457–464.
[41]
Krzysztof Onak, Baruch Schieber, Shay Solomon, and Nicole Wein. 2018. Fully Dynamic MIS in Uniformly Sparse Graphs. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. 92:1–92:14.
[42]
Aviad Rubinstein. 2018. Hardness of approximate nearest neighbor search. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. 1260–1268.
[43]
Shay Solomon. 2016. Fully dynamic maximal matching in constant update time. In Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on. IEEE, 325–334.
[44]
Christian Wulff-Nilsen. 2017. Fully-dynamic minimum spanning forest with improved worst-case update time. In 49th ACM Symposium on Theory of Computing. ACM, 1130–1143.

Cited By

View all
  • (2024)A Lossless Deamortization for Dynamic Greedy Set Cover2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00025(264-290)Online publication date: 27-Oct-2024
  • (2023)Dynamic ((1+𝜖) ln 𝑛)-Approximation Algorithms for Minimum Set Cover and Dominating SetProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585211(1187-1200)Online publication date: 2-Jun-2023
  • (2023)Chasing Positive Bodies2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00103(1694-1714)Online publication date: 6-Nov-2023
  • Show More Cited By

Index Terms

  1. Dynamic set cover: improved algorithms and lower bounds

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
    June 2019
    1258 pages
    ISBN:9781450367059
    DOI:10.1145/3313276
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 23 June 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. competitive ratio
    2. dynamic algorithm
    3. online algorithm
    4. randomized algorithm
    5. set cover

    Qualifiers

    • Research-article

    Conference

    STOC '19
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)24
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 20 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)A Lossless Deamortization for Dynamic Greedy Set Cover2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00025(264-290)Online publication date: 27-Oct-2024
    • (2023)Dynamic ((1+𝜖) ln 𝑛)-Approximation Algorithms for Minimum Set Cover and Dominating SetProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585211(1187-1200)Online publication date: 2-Jun-2023
    • (2023)Chasing Positive Bodies2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00103(1694-1714)Online publication date: 6-Nov-2023
    • (2023)Approximating Edit Distance in the Fully Dynamic Model2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00098(1628-1638)Online publication date: 6-Nov-2023
    • (2023)Deterministic Dynamic Matching in Worst-Case Update TimeAlgorithmica10.1007/s00453-023-01151-x85:12(3741-3765)Online publication date: 17-Aug-2023
    • (2022)Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference GuideACM Journal of Experimental Algorithmics10.1145/355580627(1-45)Online publication date: 13-Dec-2022
    • (2022)Dynamic Geometric Set Cover and Hitting SetACM Transactions on Algorithms10.1145/355163918:4(1-37)Online publication date: 10-Oct-2022
    • (2022)A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted MatchingACM Journal of Experimental Algorithmics10.1145/352922827(1-41)Online publication date: 7-Jul-2022
    • (2022)Scalable Katz Ranking Computation in Large Static and Dynamic GraphsACM Journal of Experimental Algorithmics10.1145/352461527(1-16)Online publication date: 7-Jul-2022
    • (2022)Faster Quantum-inspired Algorithms for Solving Linear SystemsACM Transactions on Quantum Computing10.1145/35201413:4(1-23)Online publication date: 7-Jul-2022
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media