A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Copyright policy )A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer has shown how to compute a minimum weight spanning tree of degree at most $b ��^* + \lceil \log\_b n\rceil$ in time $O(n^{4 + 1/\ln b})$ 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^{2 + 1/\ln b})$, and O(n) space per node.
- University of Paris France
- Panthéon-Assas University France
- University of Reims Champagne-Ardenne France
- French National Centre for Scientific Research France
- Paris 13 University France
distributed approximation, distributed algorithms, FOS: Computer and information sciences, [INFO.INFO-DC]Computer Science [cs]/Distributed, Discrete Mathematics (cs.DM), [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Parallel, complexity analysis, minimum degree minimum weight spanning trees, Approximation algorithms, 004, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], and Cluster Computing [cs.DC], Computer Science - Distributed, Parallel, and Cluster Computing, Graph theory (including graph drawing) in computer science, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Distributed algorithms, Distributed, Parallel, and Cluster Computing (cs.DC), approximation algorithms, Computer Science - Discrete Mathematics
distributed approximation, distributed algorithms, FOS: Computer and information sciences, [INFO.INFO-DC]Computer Science [cs]/Distributed, Discrete Mathematics (cs.DM), [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Parallel, complexity analysis, minimum degree minimum weight spanning trees, Approximation algorithms, 004, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], and Cluster Computing [cs.DC], Computer Science - Distributed, Parallel, and Cluster Computing, Graph theory (including graph drawing) in computer science, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Distributed algorithms, Distributed, Parallel, and Cluster Computing (cs.DC), approximation algorithms, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).7 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!