Author:
Hasson Yehudit,Sipper Moshe
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Interactability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)
2. Scheuermann, P., Wu, G.: Heuristic algorithms for broadcasting in point-to-point computer networks. IEEE Transactions on Computers C-33 (1984)
3. Hoelting, C.J., Schoenefeld, D.A., Wainwright, R.L.: A genetic algorithm for the minimum broadcast time problem using a global precedence vector. In: Proceedings of the 1996 ACM Symposium on Applied Computing, Philadelphia, PA, pp. 258–262. ACM Press, New York (1996)
4. SFI Studies in the Sciences of Complexity;E. Bonabeau,1999
5. Theraulaz, G., Bonabeau, E.: Coordination in distributed building. Science 269, 686–688 (1995)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献