Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
暂无分享,去创建一个
[1] Zhewei Wei,et al. Optimal Dynamic Subset Sampling: Theory and Applications , 2023, KDD.
[2] M. Henzinger,et al. Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching , 2023, IPCO.
[3] S. Khanna,et al. On Regularity Lemma and Barriers in Streaming and Dynamic Matching , 2022, STOC.
[4] Soheil Behnezhad. Dynamic Algorithms for Maximum Matching Size , 2022, SODA.
[5] Sayan Bhattacharya,et al. Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates , 2022, SODA.
[6] David Wajc,et al. Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time , 2022, SODA.
[7] Sepehr Assadi,et al. Decremental Matching in General Graphs , 2022, ICALP.
[8] A. Jambulapati,et al. Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching , 2022, ICALP.
[9] Richard Peng,et al. Maximum Flow and Minimum-Cost Flow in Almost-Linear Time , 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS).
[10] Sanjeev Khanna,et al. New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS , 2022, SODA.
[11] Haim Kaplan,et al. Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds , 2021, STOC.
[12] Fabrizio Grandoni,et al. Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds , 2021, SOSA.
[13] Amin Saberi,et al. Beating the Folklore Algorithm for Dynamic Matching , 2021, ITCS.
[14] Sayan Bhattacharya,et al. Deterministic Rounding of Dynamic Fractional Matchings , 2021, ICALP.
[15] 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).
[16] David Wajc,et al. Rounding dynamic matchings against an adaptive adversary , 2019, STOC.
[17] Vahab Mirrokni,et al. Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time , 2019, SODA.
[18] Deeparnab Chakrabarty,et al. Deterministic Dynamic Matching in O(1) Update Time , 2019, Algorithmica.
[19] S. Chechik,et al. Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[20] 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).
[21] Julia Chuzhoy,et al. A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems , 2019, STOC.
[22] Thatchaphol Saranurak,et al. Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[23] Piotr Sankowski,et al. (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time , 2019, SODA.
[24] Monika Henzinger,et al. A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching , 2018, SODA.
[25] Janardhan Kulkarni,et al. Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε2) Amortized Update Time , 2018, SODA.
[26] Moses Charikar,et al. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds , 2017, ArXiv.
[27] David Wajc,et al. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms , 2017, ICALP.
[28] Thatchaphol Saranurak,et al. Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time , 2017, STOC.
[29] Monika Henzinger,et al. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time , 2017, SODA.
[30] Amir Abboud,et al. Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[31] Shay Solomon,et al. Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[32] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[33] Søren Dahlgaard,et al. On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter , 2016, ICALP.
[34] Yang Li,et al. Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model , 2016, SODA.
[35] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.
[36] Clifford Stein,et al. Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.
[37] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[38] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2014, SODA.
[39] Tsvi Kopelowitz,et al. Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.
[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.
[41] Tobias Friedrich,et al. Exact and Efficient Generation of Geometric Random Variates and Random Graphs , 2013, ICALP.
[42] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.
[43] Konstantinos Panagiotou,et al. Efficient Sampling Methods for Discrete Distributions , 2012, Algorithmica.
[44] 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.
[45] Tsan-sheng Hsu,et al. Heterogeneous Subset Sampling , 2010, COCOON.
[46] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[47] Piotr Sankowski,et al. Maximum weight bipartite matching in matrix multiplication time , 2009, Theor. Comput. Sci..
[48] Errol L. Lloyd,et al. Fully Dynamic Maintenance of Vertex Cover , 1993, WG.
[49] Sayan Bhattacharya,et al. Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time , 2023, ArXiv.
[50] Peter Kiss,et al. Improving update times of dynamic matching algorithms from amortized to worst case , 2021, ArXiv.
[51] Manoj Gupta,et al. Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time , 2014, FSTTCS.
[52] Seth Pettie,et al. Linear-Time Approximation for Maximum Weight Matching , 2014, JACM.
[53] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .