Grade of Service Steiner Minimum Trees in the Euclidean Plane

@article{Xue2001GradeOS,
  title={Grade of Service Steiner Minimum Trees in the Euclidean Plane},
  author={Guoliang Xue and Guohui Lin and Dingzhu Du},
  journal={Algorithmica},
  year={2001},
  volume={31},
  pages={479-500}
}
Abstract. Let P = {p 1 , p 2 , \ldots, p n } be a set of n {\lilsf terminal points} in the Euclidean plane, where point p i has a {\lilsf service request of grade} g(p i ) ∈ {1, 2, \ldots, n} . Let 0 < c(1) < c(2) < ⋅s < c(n) be n real numbers. The {\lilsf Grade of Service Steiner Minimum Tree (GOSST)} problem asks for a minimum cost network interconnecting point set P and some {\lilsf Steiner points} with a service request of grade 0 such that (1) between each pair of terminal points p i and p… CONTINUE READING
7 Citations
41 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…