Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier
暂无分享,去创建一个
[1] 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..
[2] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[3] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[4] David Peleg,et al. Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.
[5] Rajeev Raman,et al. Persistence, amortization and randomization , 1991, SODA '91.
[6] Clifford Stein,et al. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms , 2017, ICALP.
[7] Sandeep Sen,et al. Fully Dynamic Maximal Matching in O (log n) Update Time , 2011, FOCS.
[8] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[9] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2014, SODA.
[10] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[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] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.
[13] Shay Solomon. Dynamic Approximate Matchings with an Optimal Recourse Bound , 2018, ArXiv.
[14] Moses Charikar,et al. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds , 2017, ArXiv.
[15] Paul F. Dietz,et al. Two algorithms for maintaining order in a list , 1987, STOC.
[16] 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..
[17] Shay Solomon,et al. Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[18] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013 .
[19] Clifford Stein,et al. Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.