Hostname: page-component-5c6d5d7d68-sv6ng Total loading time: 0 Render date: 2024-08-15T22:02:17.575Z Has data issue: false hasContentIssue false
  • English
  • Français

Constrained Steiner trees in Halin graphs

Published online by Cambridge University Press:  15 December 2003

Guangting Chen  and
Rainer E. Burkard
Guangting Chen
Affiliation:
The School of Science, Hangzhou Institute of Electronics Engineering, Hangzhou 310037, P.R. China; gtchen@sci.hziee.edu.cn.
Rainer E. Burkard
Affiliation:
Technische Universität Graz, Institut für Mathematik, Steyrergasse 30, A-8010 Graz, Austria; burkard@tugraz.at.
Get access

Abstract

In this paper, we study the problem of computing a minimum cost Steiner tree subject to a weight constraint in a Halin graph where each edge has a nonnegative integer cost and a nonnegative integer weight. We prove the NP-hardness of this problem and present a fully polynomial time approximation scheme for this NP-hard problem.

Keywords

Steiner treesHalin graphapproximation scheme.
Type
Research Article
Information
RAIRO - Operations Research , Volume 37 , Issue 3 , July 2003 , pp. 179 - 194
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

G. Chen and G. Xue, A PTAS for weight constrained Steiner trees in series-parallel graphs. Springer-verlag, Lecture Notes in Comput. Sci. 2108 (2001) 519-528.
G. Chen and G. Xue, K-pair delay constrained minimum cost routing in undirected networks. Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2001) 230-231.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of P-Completeness. San Francisco, W.H. Freeman and Company (1979).
Hassin, R., Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17 (1992) 36-42. CrossRef
F.K. Hwang and D.S. Richards, Steiner tree problems. Networks 22 (1992) 55-89.
Hwang, F.K., Richards, D.S. and Winter, P., The Steiner tree problem. Ann. Discrete Math. 53 (1992) 68-71.
T. Jiang and L. Wang, Computing shortest networks under a fixed topology, in Advances in Steiner Trees, edited by D.-Z. Du, J.M. Smith and J. H. Rubinstein. Kluwer Academic Publishers (2000) 39-62.
D.H. Lorenz and D. Raz, A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28 (2001) 213-219 .
P. Winter, Steiner problem in Halin networks. Discrete Appl. Math. 17 (1987) 281-294 .
P. Winter, Steiner problem in networks - a survey. Networks 17 (1987) 129-167.