Author:
Siddiqi Umair F.,Sait Sadiq M.
Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Audhya, G.K.; Sinha, K.; Ghosh, S.C.; Sinha, B.P.: A survey on the channel assignment problem in wireless networks. Wirel. Commun. Mob. Comput. 11(5), 583–609 (2011).
https://doi.org/10.1002/wcm.898
2. Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497–1514 (1980).
https://doi.org/10.1109/PROC.1980.11899
3. Garey, M.; Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. In: Freeman, W.H. (ed.) Books in Mathematical Series (1979).
https://books.google.com.sa/books?id=fjxGAQAAIAAJ
4. Segura, C.; Hernández-Aguirre, A.; Luna, F.; Alba, E.: Improving diversity in evolutionary algorithms: New best solutions for frequency assignment. IEEE Trans. Evol. Comput. 21(4), 539–553 (2017).
https://doi.org/10.1109/TEVC.2016.2641477
5. Sait, S.M.; Youssef, H.: Iterative Computer Algorithms with Applications in Engineering. IEEE Computer Society Press, California (1999)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献