## Revisiting Esau-Williams' Algorithm: On the Design of Local Access Networks (2004)

Venue: | IN PROC. 7TH INFORMS TELECOMMUNICATIONS CONF |

Citations: | 2 - 2 self |

### BibTeX

@INPROCEEDINGS{Jothi04revisitingesau-williams',

author = {Raja Jothi and Balaji Raghavachari},

title = {Revisiting Esau-Williams' Algorithm: On the Design of Local Access Networks},

booktitle = {IN PROC. 7TH INFORMS TELECOMMUNICATIONS CONF},

year = {2004},

pages = {104--107},

publisher = {}

}

### OpenURL

### Abstract

Given a set of nodes, each associated with a positive number denoting the traffic to be routed to a central node (root), the capacitated minimum spanning tree (CMST) problem asks for a minimum spanning tree, spanning all nodes, such that the amount of traffic routed from a subtree, linked to the root by an edge, does not exceed the given capacity constraint k. The CMST problem is NP-complete and has been extensively studied for the past 40 years. Over the last 4 decades, numerous heuristics have been proposed to overcome the exponential time complexity of exact algorithms for the CMST problem. A major problem with most of the proposed heuristics is that their worst-case running-times may be exponential. The most popular and efficient algorithm for the CMST problem is due to Esau and Williams (EW), presented in 1966, with running time O(n² log n). Almost all of the heuristics that have been proposed so far, use EW algorithm as a benchmark to compare their results. Any other heuristic that outperforms EW algorithm do so with an enormous increase in running time. In this paper, we present the an O(n² log n) algorithm that comprehensively outperforms the EW algorithm.