A New Deterministic Algorithm for Dynamic Set Cover
暂无分享,去创建一个
Danupon Nanongkai | Sayan Bhattacharya | Monika Henzinger | M. Henzinger | Danupon Nanongkai | Sayan Bhattacharya
[1] Monika Henzinger,et al. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[2] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2015, SODA.
[3] Amit Kumar,et al. Online and dynamic algorithms for set cover , 2016, STOC.
[4] Venkatesan Guruswami,et al. A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..
[5] Shiri Chechik,et al. Deterministic decremental single source shortest paths: beyond the o(mn) bound , 2016, STOC.
[6] Fabrizio Grandoni,et al. Dynamic Set Cover: Improved Algorithms & Lower Bounds , 2018 .
[7] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[8] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[9] Monika Henzinger,et al. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2018, J. ACM.
[10] Piotr Sankowski,et al. Faster dynamic matchings and vertex connectivity , 2007, SODA '07.
[11] Monika Henzinger,et al. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time , 2017, SODA.
[12] Giuseppe F. Italiano,et al. Dynamic algorithms via the primal-dual method , 2018, Inf. Comput..
[13] Peter Slavík. A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.
[14] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[15] Monika Henzinger,et al. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs , 2014, STOC.
[16] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[17] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[18] Fabrizio Grandoni,et al. Dynamic set cover: improved algorithms and lower bounds , 2019, STOC.
[19] Monika Henzinger,et al. A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching , 2018, SODA.
[20] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.
[21] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[22] Monika Henzinger,et al. Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[23] Thatchaphol Saranurak,et al. Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[24] Thatchaphol Saranurak,et al. Breaking quadratic time for small vertex connectivity and an approximation scheme , 2019, STOC.
[25] Thatchaphol Saranurak,et al. Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time , 2017, STOC.
[26] Sandeep Sen,et al. Fully Dynamic Maximal Matching in O (log n) Update Time , 2011, FOCS.
[27] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[28] Amir Abboud,et al. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[29] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.
[30] Clifford Stein,et al. Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.
[31] Piotr Sankowski,et al. (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time , 2019, SODA.
[32] David Peleg,et al. Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.
[33] Christian Wulff-Nilsen,et al. Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[34] Monika Henzinger,et al. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time , 2016, IPCO.
[35] Julia Chuzhoy,et al. A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems , 2019, STOC.
[36] Shiri Chechik,et al. Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs , 2017, SODA.
[37] Shay Solomon,et al. Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).