New deterministic approximation algorithms for fully dynamic matching
暂无分享,去创建一个
Monika Henzinger | Danupon Nanongkai | Sayan Bhattacharya | M. Henzinger | Danupon Nanongkai | Sayan Bhattacharya
[1] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.
[2] Piotr Sankowski,et al. Faster dynamic matchings and vertex connectivity , 2007, SODA '07.
[3] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[4] Sandeep Sen,et al. Fully Dynamic Maximal Matching in O(log n) Update Time , 2015, SIAM J. Comput..
[5] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[6] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2015, SODA.
[7] Tsvi Kopelowitz,et al. Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.
[8] Mihai Patrascu,et al. Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.
[9] Amir Abboud,et al. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[10] Claire Mathieu,et al. Maximum Matching in Semi-streaming with Few Passes , 2011, APPROX-RANDOM.
[11] Clifford Stein,et al. Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.
[12] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.
[13] V. G. Vizing. The chromatic class of a multigraph , 1965 .
[14] David Peleg,et al. Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.
[15] Amos Israeli,et al. An Improved Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..
[16] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[17] Michael Crouch,et al. Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching , 2014, APPROX-RANDOM.
[18] 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.