Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time
暂无分享,去创建一个
Monika Henzinger | Danupon Nanongkai | Sayan Bhattacharya | M. Henzinger | Danupon Nanongkai | Sayan Bhattacharya
[1] Bruce M. Kapron,et al. Dynamic graph connectivity in polylogarithmic worst case time , 2013, SODA.
[2] Piotr Sankowski,et al. Faster dynamic matchings and vertex connectivity , 2007, SODA '07.
[3] Norbert Zeh,et al. Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries , 2014, ISAAC.
[4] Giuseppe F. Italiano,et al. Design of Dynamic Algorithms via Primal-Dual Method , 2015, ICALP.
[5] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2015, SODA.
[6] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[7] HolmJacob,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001 .
[8] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.
[9] Giuseppe F. Italiano,et al. A new approach to dynamic all pairs shortest paths , 2003, STOC '03.
[10] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[11] Christian Wulff-Nilsen,et al. Faster Deterministic Fully-Dynamic Graph Connectivity , 2012, Encyclopedia of Algorithms.
[12] Greg N. Frederickson,et al. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[13] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.
[14] Robert Krauthgamer,et al. Orienting Fully Dynamic Graphs with Worst-Case Time Bounds , 2013, ICALP.
[15] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[16] Tsvi Kopelowitz,et al. Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.
[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] Amir Abboud,et al. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[19] Giuseppe F. Italiano,et al. A new approach to dynamic all pairs shortest paths , 2004, JACM.
[20] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[21] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 1998, STOC '98.
[22] Clifford Stein,et al. Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.
[23] References , 1971 .
[24] Greg N. Frederickson,et al. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..
[25] Sandeep Sen,et al. Fully Dynamic Maximal Matching in O (log n) Update Time , 2011, FOCS.
[26] Mikkel Thorup,et al. Worst-case update times for fully-dynamic all-pairs shortest paths , 2005, STOC '05.