DeepAI AI Chat
Log In Sign Up

Distributed Algorithms for Minimum Degree Spanning Trees

by   Michael Dinitz, et al.

The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree T for graph G=(V,E) with n vertices, such that the maximum degree d of T is the smallest among all spanning trees of G. In this paper, we present two new distributed approximation algorithms for the MDST problem. Our first result is a randomized distributed algorithm that constructs a spanning tree of maximum degree d̂ = O(dn). It requires O((D + √(n)) ^2 n) rounds (w.h.p.), where D is the graph diameter, which matches (within log factors) the optimal round complexity for the related minimum spanning tree problem. Our second result refines this approximation factor by constructing a tree with maximum degree d̂ = O(d + n), though at the cost of additional polylogarithmic factors in the round complexity. Although efficient approximation algorithms for the MDST problem have been known in the sequential setting since the 1990's, our results are first efficient distributed solutions for this problem.


page 1

page 2

page 3

page 4


Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs

In the minimum k-edge-connected spanning subgraph (k-ECSS) problem the g...

Efficient Learning of Optimal Markov Network Topology with k-Tree Modeling

The seminal work of Chow and Liu (1968) shows that approximation of a fi...

Distributed Reconfiguration of Spanning Trees

In a reconfiguration problem, given a problem and two feasible solutions...

Distributed Computation and Reconfiguration in Actively Dynamic Networks

In this paper, we study systems of distributed entities that can activel...

The Maximum Distance Problem and Minimal Spanning Trees

Given a compact E ⊂ℝ^n and s > 0, the maximum distance problem seeks a c...

A Distributed Conductance Tester Without Global Information Collection

Given an undirected graph G and a conductance parameter α, the problem o...

Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems

We develop fast near-linear time approximation algorithms for the minimu...