Dynamic set cover: improved algorithms and lower bounds
暂无分享,去创建一个
Fabrizio Grandoni | Debmalya Panigrahi | Amir Abboud | Raghavendra Addanki | Barna Saha | Debmalya Panigrahi | B. Saha | Amir Abboud | F. Grandoni | Raghavendra Addanki
[1] Aviad Rubinstein,et al. Hardness of approximate nearest neighbor search , 2018, STOC.
[2] Greg N. Frederickson,et al. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..
[3] Richard Ryan Williams,et al. Distributed PCP Theorems for Hardness of Approximation in P , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[4] Monika Henzinger,et al. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time , 2016, IPCO.
[5] Monika Henzinger,et al. Dynamic Algorithms for Graph Coloring , 2017, SODA.
[6] Sandeep Sen,et al. Fully Dynamic Maximal Matching in O (log n) Update Time , 2011, FOCS.
[7] Giuseppe F. Italiano,et al. Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[8] Christian Wulff-Nilsen,et al. Fully-dynamic minimum spanning forest with improved worst-case update time , 2016, STOC.
[9] 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..
[10] Amir Abboud,et al. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[11] Ronitt Rubinfeld,et al. Fractional Set Cover in the Streaming Model , 2017, APPROX-RANDOM.
[12] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[13] Krzysztof Onak,et al. Fully Dynamic MIS in Uniformly Sparse Graphs , 2018, ICALP.
[14] Krzysztof Onak,et al. Fully dynamic maximal independent set with sublinear update time , 2018, STOC.
[15] Giuseppe F. Italiano,et al. Design of Dynamic Algorithms via Primal-Dual Method , 2015, ICALP.
[16] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[17] Tsvi Kopelowitz,et al. Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.
[18] Shay Solomon,et al. Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[19] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[20] Piotr Sankowski,et al. Decremental single-source reachability in planar digraphs , 2017, STOC.
[21] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[22] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[23] Ittai Abraham,et al. Fully dynamic all-pairs shortest paths with worst-case update-time revisited , 2016, SODA.
[24] Giuseppe F. Italiano,et al. A new approach to dynamic all pairs shortest paths , 2003, STOC '03.
[25] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.
[26] Huacheng Yu,et al. Matching Triangles and Basing Hardness on an Extremely Popular Conjecture , 2015, STOC.
[27] Lijie Chen,et al. On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product , 2018, Electron. Colloquium Comput. Complex..
[28] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2015, SODA.
[29] Amit Kumar,et al. Online and dynamic algorithms for set cover , 2016, STOC.
[30] Sandeep Sen,et al. Fully Dynamic Maximal Matching in O(log n) Update Time , 2015, SIAM J. Comput..
[31] Andrew McGregor,et al. Better Streaming Algorithms for the Maximum Coverage Problem , 2018, Theory of Computing Systems.
[32] L FredmanMichael,et al. Storing a Sparse Table with 0(1) Worst Case Access Time , 1984 .
[33] Sepehr Assadi,et al. Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem , 2018, SODA.
[34] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[35] Giuseppe F. Italiano,et al. A new approach to dynamic all pairs shortest paths , 2004, JACM.
[36] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.