In network communication systems, frequently messages are routed along a minimum diameter spanning tree (MDST) of the network, to minimize the maximum delay in delivering a message. When a transient edge failure occurs, it is important to choose a temporary replacement edge which minimizes the diameter of the new spanning tree. Such an optimal replacement is called the best swap. As a natural extension, the all-best-swaps (ABS) problemis the problem of finding the best swap for every edge of the MDST. Given a weighted graph G = (V, E), where |V| = n and |E| = m, we solve the ABS problem in O(n√m) time and O(m + n) space, thus improving previous bounds for m = o(n2). © Springer-Verlag Berlin Heidelberg 1998.
CITATION STYLE
Nardelli, E., Proietti, G., & Widmayer, P. (1998). Finding all the best swaps of a minimum diameter spanning tree under transient edge failures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1461 LNCS, pp. 55–66). Springer Verlag. https://doi.org/10.1007/3-540-68530-8_5
Mendeley helps you to discover research relevant for your work.