Abstract
The minimum Steiner tree problem has wide application background, such as transportation system, communication network, pipeline design and VISL, etc. It is unfortunately that the computational complexity of the problem is NP-hard. People are common to find some special problems to consider. Since the complexity of the Steiner tree problem, the almost of papers are relate to the object of small data problem, i.e., the number of involved objects is small. Those conclusions are useful to the theoretical research from which some algorithms are originated. For the practical problems, there are large number of objects are need to be considered. In this paper, we introduce an approximate algorithm and give an example with seven objects to consider the location-selection of wireless network problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. American Elsevier, New York (1976)
Melzak, Z.A.: On the problem of steiner. Canada. Math. Mull. 4(2), 143 (1961)
Hwang, F.K., Richard, D.S.: Steiner tree problem. Network 22, 55 (1992)
Yue, M.: Minimal Network-The problem of Steiner Tree. Zhejing Scientific and Technological Publishing House, Hangzhou (2001)
Yue, M., Cheng, C.: A Note on the Steiner Problem-An approach to find the minimal network with five given points. OR Transactions 14, 1 (2010)
Yao, B., Zhang, Z.-F., Wang, J.-F.: Some results on spanning trees. Acta Mahtematica Application Sinica, English Series 26, 607 (2010)
Yue, M.-Y.: A Report on the Steiner Ration Conjecture. OR Translations 4, 1 (2000)
Jin, H.-M., Ma, L., Wang, Z.-M.: Intelligent optimization algorithms for euclidean steiner minimum tree problem. Computer Engineering 32, 201 (2006)
Lin, D., Du, L., Lu, X.: A Restricted Steiner tree Problem I. In: ICIME 2011, vol. 6, p. 350 (2011)
Zhang, Y., Lu, X., Lin, D.: A Restricted Steiner tree Problem II. In: ICIME 2011, vol. 6, p. 358 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, W., Li, Qb., Lu, Xx. (2011). An Approximate Algorithm Application to Solve the Location-Selection of Wireless Network Problem. In: Jin, D., Lin, S. (eds) Advances in Computer Science, Intelligent System and Environment. Advances in Intelligent and Soft Computing, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23756-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-23756-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23755-3
Online ISBN: 978-3-642-23756-0
eBook Packages: EngineeringEngineering (R0)