Rounding dynamic matchings against an adaptive adversary
暂无分享,去创建一个
[1] Sebastian Krinninger,et al. Dynamic low-stretch trees via dynamic low-diameter decompositions , 2018, STOC.
[2] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[3] Mohsen Ghaffari,et al. Simplified and Space-Optimal Semi-Streaming ( 2 + ε )-Approximate Matching , 2018 .
[4] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[5] Ola Svensson,et al. Online Matching with General Arrivals , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[6] Sandeep Sen,et al. Fully Dynamic Maximal Matching in O (log n) Update Time , 2011, FOCS.
[7] Aaron Bernstein,et al. Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs , 2017, ICALP.
[8] Søren Dahlgaard,et al. On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter , 2016, ICALP.
[9] Boaz Patt-Shamir,et al. Improved Distributed Approximate Matching , 2015, J. ACM.
[10] David Wajc,et al. Randomized Online Matching in Regular Graphs , 2018, SODA.
[11] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2015, SODA.
[12] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[13] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.
[14] David Peleg,et al. Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.
[15] Ilan Reuven Cohen,et al. Tight Bounds for Online Edge Coloring , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[16] 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).
[17] A. Khursheed,et al. Positive dependence in multivariate distributions , 1981 .
[18] Monika Henzinger,et al. Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , 2013, FOCS.
[19] Desh Ranjan,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[20] Clifford Stein,et al. Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.
[21] Lisa Fleischer,et al. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..
[22] Yang Li,et al. The Stochastic Matching Problem with (Very) Few Queries , 2016, EC.
[23] Shiri Chechik,et al. Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs , 2017, SODA.
[24] Ronitt Rubinfeld,et al. Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover , 2018, PODC.
[25] Ashish Goel,et al. On the communication and streaming complexity of maximum bipartite matching , 2012, SODA.
[26] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[27] Amit Kumar,et al. Online and dynamic algorithms for set cover , 2016, STOC.
[28] Giuseppe F. Italiano,et al. Dynamic algorithms via the primal-dual method , 2018, Inf. Comput..
[29] Sepehr Assadi,et al. Towards a Unified Theory of Sparsification for Matching Problems , 2019, SOSA@SODA.
[30] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.
[31] Monika Henzinger,et al. Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[32] 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).
[33] Monika Henzinger,et al. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time , 2016, IPCO.
[34] Monika Henzinger,et al. Dynamic Algorithms for Graph Coloring , 2017, SODA.
[35] Bruce M. Kapron,et al. Dynamic graph connectivity in polylogarithmic worst case time , 2013, SODA.
[36] Christian Wulff-Nilsen,et al. Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler , 2020, SODA.
[37] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[38] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[39] K. Joag-dev,et al. Negative Association of Random Variables with Applications , 1983 .
[40] Julia Chuzhoy,et al. A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems , 2019, STOC.
[41] Shimon Even,et al. An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[42] Shay Solomon,et al. Reoptimization via Gradual Transformations , 2018 .
[43] Euiwoong Lee,et al. Maximum Matching in the Online Batch-arrival Model , 2017, IPCO.
[44] Moses Charikar,et al. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds , 2017, ArXiv.
[45] Ran Duan,et al. Dynamic Edge Coloring with Improved Approximation , 2019, SODA.
[46] Ami Paz,et al. A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model , 2017, SODA.
[47] Errol L. Lloyd,et al. Fully Dynamic Maintenance of Vertex Cover , 1993, WG.
[48] 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.
[49] Vahab S. Mirrokni,et al. Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time , 2020, SODA.
[50] 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).
[51] Tsvi Kopelowitz,et al. Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.
[52] Shay Solomon,et al. Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[53] Virginia Vassilevska Williams,et al. Metatheorems for Dynamic Weighted Matching , 2017, ITCS.
[54] Mikkel Thorup,et al. Near-optimal fully-dynamic graph connectivity , 2000, STOC '00.
[55] Janardhan Kulkarni,et al. Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε2) Amortized Update Time , 2018, SODA.
[56] Ami Paz,et al. A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model , 2019, ACM Trans. Algorithms.
[57] Aleksander Madry,et al. Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms , 2010, STOC '10.
[58] Shay Solomon,et al. Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs , 2021, ITCS.
[59] 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).
[60] Shiri Chechik,et al. Deterministic decremental single source shortest paths: beyond the o(mn) bound , 2016, STOC.
[61] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[62] Soumojit Sarkar,et al. Fully dynamic randomized algorithms for graph spanners , 2012, TALG.
[63] Vahab Mirrokni,et al. Distributed Weighted Matching via Randomized Composable Coresets , 2019, ICML.
[64] Christian Wulff-Nilsen,et al. Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary , 2020, SODA.
[65] Clifford Stein,et al. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms , 2017, ICALP.
[66] Monika Henzinger,et al. A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching , 2018, SODA.
[67] Piotr Sankowski,et al. Faster dynamic matchings and vertex connectivity , 2007, SODA '07.
[68] Monika Henzinger,et al. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time , 2017, SODA.
[69] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[70] Thatchaphol Saranurak,et al. Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time , 2017, STOC.
[71] David Eppstein,et al. Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[72] Amir Abboud,et al. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.