Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems

We develop fast near-linear time approximation algorithms for the minimum-cost version of the Bounded-Degree MST problem and its generalization the Crossing Spanning Tree problem. We solve the underlying LP to within a $(1+\epsilon)$ approximation factor in near-linear time via multiplicative weight update (MWU) techniques. To round the fractional solution, in our main technical contribution, we describe a fast near-linear time implementation of swap-rounding in the spanning tree polytope of a graph. The fractional solution can also be used to sparsify the input graph that can in turn be used to speed up existing combinatorial algorithms. Together these ideas lead to significantly faster approximation algorithms than known before.

[1]  Jan Vondrák,et al.  Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

[2]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[3]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[4]  Mohit Singh,et al.  Degree bounded matroids and submodular flows , 2008, Comb..

[5]  R. Ravi,et al.  Primal-dual meets local search: approximating MST's with nonuniform degree bounds , 2003, STOC '03.

[6]  Nikhil Bansal,et al.  On a generalization of iterated and randomized rounding , 2018, STOC.

[7]  J. Vygen,et al.  An improved approximation algorithm for ATSP , 2019, STOC.

[8]  Jan Vondrák,et al.  Multi-budgeted matchings and matroid intersection via dependent rounding , 2011, SODA '11.

[9]  Martin Fürer,et al.  Approximating the Minimum-Degree Steiner Tree to within One of Optimal , 1994, J. Algorithms.

[10]  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).

[11]  Di Wang.  Fast Approximation Algorithms for Positive Linear Programs , 2017 .

[12]  Michel X. Goemans,et al.  Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[13]  Mohit Singh,et al.  A Randomized Rounding Approach to the Traveling Salesman Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[14]  Kent Quanrud,et al.  Randomized MWU for Positive LPs , 2018, SODA.

[15]  Aaron Schild,et al.  An almost-linear time algorithm for uniform random spanning tree generation , 2017, STOC.

[16]  Nikhil Bansal,et al.  Additive guarantees for degree bounded directed network design , 2008, STOC.

[17]  László A. Végh,et al.  A constant-factor approximation algorithm for the asymmetric traveling salesman problem , 2017, STOC.

[18]  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.

[19]  Huy L. Nguyen,et al.  Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint , 2018, ICALP.

[20]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[21]  Kent Quanrud,et al.  Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems , 2017, SODA.

[22]  Sahil Singla,et al.  Faster Matroid Intersection , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[23]  Jochen Könemann,et al.  Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems , 2007, SIAM J. Comput..

[24]  Kent Quanrud,et al.  Fast and Deterministic Approximations for k-Cut , 2018, APPROX-RANDOM.

[25]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[26]  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).

[27]  Mohit Singh,et al.  Entropy, optimization and counting , 2013, STOC.

[28]  Ran Duan,et al.  Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees , 2020, LATIN.

[29]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[30]  Jochen Könemann,et al.  On generalizations of network design problems with degree bounds , 2010, Mathematical Programming.

[31]  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.

[32]  Anna R. Karlin,et al.  An improved approximation algorithm for TSP in the half integral case , 2019, STOC.

[33]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[34]  Maxim Sviridenko,et al.  Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..

[35]  Kent Quanrud,et al.  Fast Approximations for Metric-TSP via Linear Programming , 2018, ArXiv.

[36]  David P. Williamson,et al.  An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem , 2015, Algorithmica.

[37]  Kent Quanrud,et al.  Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. , 2021 .

[38]  Nikhil Bansal,et al.  Additive Guarantees for Degree-Bounded Directed Network Design , 2009, SIAM J. Comput..

[39]  Mohit Singh,et al.  On the Crossing Spanning Tree Problem , 2004, APPROX-RANDOM.

[40]  Sein Win,et al.  On a connection between the existence ofk-trees and the toughness of a graph , 1989, Graphs Comb..

[41]  Mohit Singh,et al.  Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal , 2015, J. ACM.

[42]  Aleksandar Nikolov,et al.  Tight hardness results for minimizing discrepancy , 2011, SODA '11.

[43]  Satish Rao,et al.  What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs , 2009, Algorithmica.

[44]  Anna R. Karlin,et al.  A (Slightly) Improved Approximation Algorithm for Metric TSP , 2020, ArXiv.

[45]  David R. Karger,et al.  Random sampling and greedy sparsification for matroid optimization problems , 1998, Math. Program..

[46]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[47]  R. Ravi,et al.  Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds , 2005, SIAM J. Comput..

[48]  Rico Zenklusen,et al.  Chain-Constrained Spanning Trees , 2013, IPCO.

[49]  Nima Anari,et al.  Log-Concave Polynomials IV: Exchange Properties, Tight Mixing Times, and Faster Sampling of Spanning Trees , 2020, ArXiv.

[50]  Amin Saberi,et al.  An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.

[51]  Rajiv Gandhi,et al.  Dependent rounding and its applications to approximation algorithms , 2006, JACM.

[52]  Kent Quanrud,et al.  Fast LP-based Approximations for Geometric Packing and Covering Problems , 2020, SODA.

[53]  Chaitanya Swamy,et al.  Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems , 2016, IPCO.

[54]  Aravind Srinivasan,et al.  Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[55]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..