A distributed approximation algorithm for the minimum degree minimum weight spanning trees

Simple item page
dc.creatorLavault, Christian
dc.creatorValencia-Pabon, Mario
dc.date2006-07-08
dc.date.accessioned2026-07-07T07:16:17Z
dc.date.available2026-07-07T07:16:17Z
dc.descriptionFischer 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.
dc.identifierhttps://arxiv.org/abs/cs/0607031
dc.identifierhttp://arxiv.org/abs/cs/0607031
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113535
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectDiscrete Mathematics
dc.titleA distributed approximation algorithm for the minimum degree minimum weight spanning trees
dc.typetext

Files

Collections

arXiv