A distributed approximation algorithm for the minimum degree minimum weight spanning trees
نویسندگان
چکیده
منابع مشابه
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer [3] has shown how to compute a minimum weight spanning tree of degree at most b∆∗ + ⌈logb n⌉ in time O(n 4+1/ln ) for any constant b > 1, where ∆∗ is the value of an optimal solution and n is the number of nodes in the network. In this paper, we propose a distributed version of Fischer’s algorithm that requires messages and time complexity O(n ), and O(n) space per node.
متن کاملSummary of “A Distributed Algorithm for Minimum-Weight Spanning Trees”
This document summarizes the article published by Gallagerher et. al on “A Distributed Algorithm for Minimum-Weight Spanning Trees”. The asynchronous distributed algorithm determines a minimum-weight spanning tree for an undirected graph that has distinct finite weights for every edge.
متن کاملLow-Degree Minimum Spanning Trees
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum spanning tree (MST). We prove that under the Lp norm, the maximum vertex degree over all MSTs is equal to the Hadwiger number of the corresponding unit ball; we show an even tighter bound for MSTs where the maximum degree is minimized. We give the best-known bounds for the maximum MST degree for ar...
متن کاملDegree-bounded minimum spanning trees
* to be exact, times the weight of a minimum spanning tree (MST). In particular, we present an improved analysis of Chan’s degree-4 MST algorithm [4]. Previous results. Arora [1] and Mitchell [9] presented PTASs for TSP in Euclidean metric, for fixed dimensions. Unfortunately, neither algorithm extends to find degree-3 or degree-4 trees. Recently, Arora and Chang [3] have devised a quasi-polyno...
متن کاملCounting Minimum Weight Spanning Trees
We present an algorithm for counting the number of minimum weight spanning trees, based on the fact that the generating function for the number of spanning trees of a given graph, by weight, can be expressed as a simple determinant. For a graph with n vertices and m edges, our algorithm requires O(M(n)) elementary operations, whereM(n) is the number of elementary operations needed to multiply n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2008
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2007.07.005