Reoptimization via Gradual Transformations
暂无分享,去创建一个
[1] Krzysztof Onak,et al. Maintaining a large matching and a small vertex cover , 2010, STOC '10.
[2] G. Ausiello,et al. Complexity and Approximation in Reoptimization , 2008 .
[3] Baruch Schieber,et al. A Theory and Algorithms for Combinatorial Reoptimization , 2012, Algorithmica.
[4] Dariusz Leniowski,et al. Shortest Augmenting Paths for Online Matchings on Trees , 2017, Theory of Computing Systems.
[5] 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).
[6] Shay Solomon,et al. Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[7] Clifford Stein,et al. Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.
[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] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[11] Vangelis Th. Paschos,et al. Reoptimization of minimum and maximum traveling salesman's tours , 2009, J. Discrete Algorithms.
[12] Vahab S. Mirrokni,et al. Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs , 2017, SODA.
[13] Ming-Yang Kao,et al. Online Perfect Matching and Mobile Computing , 1995, WADS.
[14] Clifford Stein,et al. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms , 2017, ICALP.
[15] Bruce M. Kapron,et al. Dynamic graph connectivity in polylogarithmic worst case time , 2013, SODA.
[16] Richard Peng,et al. On Fully Dynamic Graph Sparsifiers , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[17] Dennis Komm,et al. Reoptimization of the Shortest Common Superstring Problem , 2009, Algorithmica.
[18] Krzysztof Onak,et al. Fully dynamic maximal independent set with sublinear update time , 2018, STOC.
[19] David Peleg,et al. Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.
[20] Amit Kumar,et al. Maintaining Assignments Online: Matching, Scheduling, and Flows , 2014, SODA.
[21] Michael A. Bender,et al. Reallocation Problems in Scheduling , 2013, Algorithmica.
[22] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[23] Kirk Pruhs,et al. A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs , 2015, APPROX-RANDOM.
[24] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[25] Vangelis Th. Paschos,et al. Fast reoptimization for the minimum spanning tree problem , 2010, J. Discrete Algorithms.
[26] Morteza Zadimoghaddam,et al. Randomized Composable Core-sets for Distributed Submodular Maximization , 2015, STOC.
[27] Keren Censor-Hillel,et al. Optimal Dynamic Distributed MIS , 2015, PODC.
[28] Moses Charikar,et al. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds , 2017, ArXiv.
[29] Davide Bilò. New algorithms for Steiner tree reoptimization , 2018, ICALP.
[30] Anass Nagih,et al. Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem , 2006, Discret. Appl. Math..
[31] Vijay V. Vazirani. An Improved Definition of Blossoms and a Simpler Proof of the MV Matching Algorithm , 2012, ArXiv.
[32] Dariusz Leniowski,et al. A Tight Bound for Shortest Augmenting Paths on Trees , 2018, LATIN.
[33] Tsvi Kopelowitz,et al. Simultaneously Load Balancing for Every p-norm, With Reassignments , 2017, ITCS.
[34] Michael A. Bender,et al. Cost-Oblivious Storage Reallocation , 2014, ACM Trans. Algorithms.
[35] Dariusz Leniowski,et al. Online Bipartite Matching in Offline Time , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[36] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[37] Jacob Holm,et al. Online Bipartite Matching with Amortized O(log 2 n) Replacements , 2019, J. ACM.
[38] Henry Lin,et al. Online Bipartite Perfect Matching With Augmentations , 2009, IEEE INFOCOM 2009.
[39] Sepehr Assadi,et al. Randomized Composable Coresets for Matching and Vertex Cover , 2017, SPAA.
[40] Clifford Stein,et al. Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.
[41] Amit Kumar,et al. Online and dynamic algorithms for set cover , 2016, STOC.
[42] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..