Optimal Approximate Algorithm to Solve Location-Selection of Recycle Water Station Problem
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 or find the approximate algorithm to solve different problems. 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.
Provided by: Journal of Theoretical and Applied Information Technology Topic: Mobility Date Added: Feb 2013 Format: PDF