暂无分享,去创建一个
[1] 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.
[2] David Peleg,et al. Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.
[3] Giuseppe F. Italiano,et al. Design of Dynamic Algorithms via Primal-Dual Method , 2015, ICALP.
[4] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.
[5] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[6] Clifford Stein,et al. Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.
[7] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2015, SODA.
[8] Amit Kumar,et al. Online and dynamic algorithms for set cover , 2016, STOC.
[9] Raghavendra Addanki,et al. Fully Dynamic Set Cover - Improved and Simple , 2018, ArXiv.
[10] Monika Henzinger,et al. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time , 2017, SODA.
[11] Monika Henzinger,et al. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time , 2016, IPCO.
[12] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[13] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[14] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.
[15] Robert Krauthgamer,et al. Orienting Fully Dynamic Graphs with Worst-Case Time Bounds , 2013, ICALP.
[16] Moses Charikar,et al. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds , 2017, ArXiv.
[17] Clifford Stein,et al. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms , 2017, ICALP.