Deterministic Rounding of Dynamic Fractional Matchings
暂无分享,去创建一个
[1] Clifford Stein,et al. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms , 2017, ICALP.
[2] Piotr Sankowski,et al. (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time , 2019, SODA.
[3] Tsvi Kopelowitz,et al. Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.
[4] Shay Solomon,et al. Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[5] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[6] Monika Henzinger,et al. A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching , 2018, SODA.
[7] Sepehr Assadi,et al. Towards a Unified Theory of Sparsification for Matching Problems , 2019, SOSA@SODA.
[8] 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.
[9] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.
[10] Soheil Behnezhad,et al. Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[11] Christian Wulff-Nilsen,et al. Decremental APSP in Directed Graphs Versus an Adaptive Adversary , 2020, ArXiv.
[12] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .
[13] Thatchaphol Saranurak,et al. The Expander Hierarchy and its Applications to Dynamic Graph Algorithms , 2020, ACM-SIAM Symposium on Discrete Algorithms.
[14] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[15] Vahab S. Mirrokni,et al. Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time , 2020, SODA.
[16] Mihai Patrascu,et al. Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.
[17] Monika Henzinger,et al. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time , 2017, SODA.
[18] Ran Duan,et al. Dynamic Edge Coloring with Improved Approximation , 2019, SODA.
[19] Fabrizio Grandoni,et al. Dynamic set cover: improved algorithms and lower bounds , 2019, STOC.
[20] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2015, SODA.
[21] Thatchaphol Saranurak,et al. Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[22] Moses Charikar,et al. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds , 2017, ArXiv.
[23] Piotr Sankowski,et al. Faster dynamic matchings and vertex connectivity , 2007, SODA '07.
[24] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[25] Robert Krauthgamer,et al. Orienting Fully Dynamic Graphs with Worst-Case Time Bounds , 2013, ICALP.
[26] Manoj Gupta,et al. Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time , 2014, FSTTCS.
[27] David Wajc,et al. Rounding dynamic matchings against an adaptive adversary , 2019, STOC.
[28] Janardhan Kulkarni,et al. Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε2) Amortized Update Time , 2018, SODA.
[29] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[30] David Peleg,et al. Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.
[31] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[32] Kasper Green Larsen. The cell probe complexity of dynamic range counting , 2011, STOC '12.
[33] Monika Henzinger,et al. Randomized dynamic graph algorithms with polylogarithmic time per operation , 1995, STOC '95.
[34] Richard Peng,et al. A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[35] 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).
[36] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.
[37] Amit Kumar,et al. Online and dynamic algorithms for set cover , 2016, STOC.
[38] Monika Henzinger,et al. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time , 2016, IPCO.
[39] Clifford Stein,et al. Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.
[40] Amir Abboud,et al. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.