暂无分享,去创建一个
[1] R. Ravi,et al. Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds , 2005, SIAM J. Comput..
[2] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[3] Jan Vondrák,et al. Multi-budgeted matchings and matroid intersection via dependent rounding , 2011, SODA '11.
[4] Nima Anari,et al. Log-Concave Polynomials IV: Exchange Properties, Tight Mixing Times, and Faster Sampling of Spanning Trees , 2020, ArXiv.
[5] Amin Saberi,et al. An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.
[6] Jochen Könemann,et al. On generalizations of network design problems with degree bounds , 2010, Mathematical Programming.
[7] Kent Quanrud,et al. Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems , 2017, SODA.
[8] Jan Vondrák,et al. Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[9] Chaitanya Swamy,et al. Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems , 2016, IPCO.
[10] Ran Duan,et al. Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees , 2020, LATIN.
[11] Vera Traub,et al. An improved approximation algorithm for ATSP , 2020, STOC.
[12] Mohit Singh,et al. On the Crossing Spanning Tree Problem , 2004, APPROX-RANDOM.
[13] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[14] Kent Quanrud,et al. Fast LP-based Approximations for Geometric Packing and Covering Problems , 2020, SODA.
[15] Anna R. Karlin,et al. An improved approximation algorithm for TSP in the half integral case , 2019, STOC.
[16] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[17] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Satish Rao,et al. What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs , 2009, Algorithmica.
[19] Sein Win,et al. On a connection between the existence ofk-trees and the toughness of a graph , 1989, Graphs Comb..
[20] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[21] Mohit Singh,et al. Degree bounded matroids and submodular flows , 2008, Comb..
[22] Sahil Singla,et al. Faster Matroid Intersection , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[23] Rico Zenklusen,et al. Chain-Constrained Spanning Trees , 2013, IPCO.
[24] 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).
[25] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[26] David R. Karger,et al. Random sampling and greedy sparsification for matroid optimization problems , 1998, Math. Program..
[27] Anna R. Karlin,et al. A (Slightly) Improved Approximation Algorithm for Metric TSP , 2020, ArXiv.
[28] Nikhil Bansal,et al. On a generalization of iterated and randomized rounding , 2018, STOC.
[29] Michel X. Goemans,et al. Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[30] Nikhil Bansal,et al. Additive guarantees for degree bounded directed network design , 2008, STOC.
[31] Kent Quanrud,et al. Fast and Deterministic Approximations for k-Cut , 2018, APPROX-RANDOM.
[32] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[33] Nima Anari,et al. Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP , 2014, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[34] Mohit Singh,et al. Entropy, optimization and counting , 2013, STOC.
[35] Martin Fürer,et al. Approximating the Minimum-Degree Steiner Tree to within One of Optimal , 1994, J. Algorithms.
[36] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..
[37] Aleksandar Nikolov,et al. Tight hardness results for minimizing discrepancy , 2011, SODA '11.
[38] Nima Anari,et al. Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[39] Kent Quanrud,et al. Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[40] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[41] Mohit Singh,et al. Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal , 2015, J. ACM.
[42] Di Wang. Fast Approximation Algorithms for Positive Linear Programs , 2017 .
[43] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[44] Mohit Singh,et al. A Randomized Rounding Approach to the Traveling Salesman Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[45] Kent Quanrud,et al. Randomized MWU for Positive LPs , 2018, SODA.
[46] Aaron Schild,et al. An almost-linear time algorithm for uniform random spanning tree generation , 2017, STOC.
[47] László A. Végh,et al. A constant-factor approximation algorithm for the asymmetric traveling salesman problem , 2017, STOC.
[48] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..