Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Computer Networks and Communications,Computer Graphics and Computer-Aided Design,Computational Theory and Mathematics,Artificial Intelligence,General Computer Science
Reference25 articles.
1. Abraham I, Gavoille C, Malkhi D, Nisan N, Thorup M. Compact name-independent routing with minimum stretch. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004, pp. 20–4.
2. Awerbuch B, Bar-Noy A, Linial N, Peleg D. Improved routing strategies with succinct tables. J Algorithms. 1990;11(3):307–41.
3. Awerbuch B, Peleg, D. Sparse partitions. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 503–13.
4. Blesa MJ, Xhafa F. A c++ implementation of tabu search for k- cardinality tree problem based on generic programming and component reuse. Citeseer: Young Researchers Workshop; 2000.
5. Blum C, Blesa MJ. New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Comput Oper Res. 2005;32(6):1355–77.