Grade of Service Steiner Trees in Series-Parallel Networks

  • Charles J. Colbourn
  • Guoliang Xue
Part of the Combinatorial Optimization book series (COOP, volume 6)


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.


Steiner Tree Service Request Steiner Tree Problem Steiner Minimal Tree Minimum Total Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Balakrishnan, T.L. Magnanti, and P. Mirchandani, Modeling and heuristic worst-case performance analysis of the two-level network design problem, Management Science, Vol. 40(1994), pp. 846–867.zbMATHCrossRefGoogle Scholar
  2. [2]
    J.R. Current, C.S. Revelle, and J.L. Cohon, The hierarchical network design problem, European Journal of Operational Research, Vol. 27(1986), pp. 57–66.zbMATHCrossRefGoogle Scholar
  3. [3]
    M.R. Garey, R.L. Graham and D.S. Johnson, The complexity of computing Steiner minimal trees, SIAM Journal on Applied Mathematics, Vol. 32(1977), pp. 835–859.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    C. Duin and A. Volgenant, Reducing the hierarchical network design problem European Journal of Operational Research, Vol. 39(1989), pp. 332–344.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    C. Duin and T. Volgenant, The multi-weighted Steiner tree problem, Annals of Operations Research, Vol. 33(1991), pp. 451–469.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    A.M. Farley, Networks immune to isolated failures, Networks, Vol. 11(1981), pp. 255–268.MathSciNetzbMATHCrossRefGoogle Scholar
  7. [7]
    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
  8. [8]
    F. Hwang and D. Richards, Steiner tree problems, Networks, Vol. 22(1992), pp. 55–89.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    F.K. Hwang, D.S. Richards and Pawel Winter, The Steiner tree problem, Annals of Discrete Mathematics, Vol. 53, North-Holland, 1992.Google Scholar
  10. [10]
    P. Mirchandani, The multi-tier tree problem, INFORMS Journal on Computing, Vol. 8(1996), pp. 202–218.zbMATHCrossRefGoogle Scholar
  11. [11]
    J.A. Wald and C.J. Colbourn, Steiner trees, partial 2-trees, and minimum IFI networks, Networks, Vol. 13(1983), pp. 159–167.MathSciNetzbMATHCrossRefGoogle Scholar
  12. [12]
    P. Winter, Generalized Steiner problem in series-parallel networks, J. Algorithms, Vol. 7(1986), pp. 549–566.MathSciNetzbMATHCrossRefGoogle Scholar
  13. [13]
    P. Winter, The Steiner problem in graphs: a survey, Networks, Vol. 17(1987), pp. 129–167.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14]
    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

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Charles J. Colbourn
    • 1
  • Guoliang Xue
    • 1
  1. 1.Department of Computer ScienceUniversity of VermontBurlingtonUSA

Personalised recommendations