Heuristics with Constant Error Guarantees for the Design of Tree Networks

A tree network is a collection of trees rooted at a common central node. Several types of network design problems can be viewed as requiring the formation of a spanning tree network of minimum length, subject to a bound on the sum of "weights" on the nodes of any component tree. Such problems are NP-complete, and experience has shown that only small examples can be solved to optimality. This paper describes an efficient heuristic algorithm based on partitioning of a traveling salesman tour. When all the nodes have a unit weight and the bound is K, the heuristic finds a solution whose cost is at most 3-2/K times the minimum; in the general case the error bound is 4.

[1]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[2]  Stuart E. Dreyfus,et al.  Applied Dynamic Programming , 1965 .

[3]  L. R. Esau,et al.  On Teleprocessing System Design Part II: A Method for Approximating the Optimal Network , 1966, IBM Syst. J..

[4]  Wushow Chou,et al.  A Unified Algorithm for Designing Multidrop Teleprocessing Networks , 1974, IEEE Trans. Commun..

[5]  R. Boorstyn,et al.  Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..

[6]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[7]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[8]  A. Kershenbaum,et al.  Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design , 1980, IEEE Trans. Commun..

[9]  P. Camerini,et al.  Complexity of spanning tree problems: Part I , 1980 .

[10]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[11]  Bezalel Gavish,et al.  Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.

[12]  Aaron Kershenbaum,et al.  Centralized teleprocessing network design , 1976, Networks.

[13]  R. Sharma.  Design of an Economical Multidrop Network Topology with Capacity Constraints , 1983, IEEE Trans. Commun..

[14]  Francesco Maffioli,et al.  On the complexity of finding multi-constrained spanning trees , 1983, Discret. Appl. Math..

[15]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[16]  B. Gavish,et al.  Heuristics for unequal weight delivery problems with a fixed error guarantee , 1987 .

[17]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.