Grade of Service Steiner Trees in Series-Parallel Networks
The grade of service Steiner tree problem is to determine the minimum total cost of an assignment of a grade of service to each link in a network, so that between each pair of nodes there is a path whose minimum grade of service is at least as large as the grade required at each of the end nodes. This problem has important applications in communication networks and in transportation. It generalizes the Steiner tree problem, in which there are two grades of service. When the network has n nodes and there are r grades of service, an algorithm to determine the cost of a grade of service Steiner tree is given which runs in O(r 3 n) time on series-parallel networks.
KeywordsSteiner Tree Service Request Steiner Tree Problem Steiner Minimal Tree Minimum Total Cost
Unable to display preview. Download preview PDF.
- M. Grötschel, C.L. Monma, and M. Stoer, Design of survivable networks, in: Network Models (M. Ball et al., eds.) Elsevier North-Holland, 1995, pp. 617–672.Google Scholar
- F.K. Hwang, D.S. Richards and Pawel Winter, The Steiner tree problem, Annals of Discrete Mathematics, Vol. 53, North-Holland, 1992.Google Scholar
- G.L. Xue, G.-H. Lin and D.-Z. Du, Grade of service Euclidean Steiner minimum trees, 1999 IEEE International Conference on Circuits and Systems, to appear.Google Scholar