A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
9th International Conference on Electronics, Circuits and Systems
To solve the star topology communication network design problem the following optimization tasks must be solved: the concentrator quantity problem, the concentrator location problem and the assignment problem. The two last mentioned problems are NP-hard and the optimal solution of these problems has not been found for large networks. Algorithms looking for the optimal solution of the assignment problem (with minimal total link cost) can be used only for small networks with several hundreds ofdoi:10.1109/icecs.2002.1046290 fatcat:7d6eizero5hcbl34vqfx7fej74