Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
share
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+ϵ) 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.
READ FULL TEXT