Dynamic Set Cover: Improved Amortized and Worst-Case Update Time
暂无分享,去创建一个
[1] Danupon Nanongkai,et al. A New Deterministic Algorithm for Dynamic Set Cover , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[2] Fabrizio Grandoni,et al. Dynamic set cover: improved algorithms and lower bounds , 2019, STOC.
[3] Monika Henzinger,et al. A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching , 2018, SODA.
[4] Janardhan Kulkarni,et al. Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε2) Amortized Update Time , 2018, SODA.
[5] Clifford Stein,et al. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms , 2017, ICALP.
[6] 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).
[7] Thatchaphol Saranurak,et al. Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time , 2017, STOC.
[8] Kasper Green Larsen,et al. Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds , 2017, Electron. Colloquium Comput. Complex..
[9] Monika Henzinger,et al. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time , 2017, SODA.
[10] Amit Kumar,et al. Online and dynamic algorithms for set cover , 2016, STOC.
[11] Christian Wulff-Nilsen,et al. Fully-dynamic minimum spanning forest with improved worst-case update time , 2016, STOC.
[12] Monika Henzinger,et al. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time , 2016, IPCO.
[13] Shay Solomon,et al. Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[14] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[15] David Peleg,et al. Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.
[16] Giuseppe F. Italiano,et al. Design of Dynamic Algorithms via Primal-Dual Method , 2015, ICALP.
[17] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2014, SODA.
[18] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[19] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.
[20] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[21] Kasper Green Larsen. The cell probe complexity of dynamic range counting , 2011, STOC '12.
[22] Sandeep Sen,et al. Fully Dynamic Maximal Matching in O (log n) Update Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[23] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[24] Timothy M. Chan,et al. Dynamic Connectivity: Connecting to Networks and Geometry , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[25] 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..
[26] Erik D. Demaine,et al. Logarithmic Lower Bounds in the Cell-Probe Model , 2005, SIAM J. Comput..
[27] Venkatesan Guruswami,et al. A new multilayered PCP and the hardness of hypergraph vertex cover , 2003, STOC '03.
[28] Moses Charikar,et al. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier , 2018, ICALP.