Publisher
Springer Science and Business Media LLC
Reference40 articles.
1. Abraham I, Gavoille C, Malkhi D, Nisan N, Thorup M (2004) Compact name-independent routing with minimum stretch. In: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp 20–24
2. Awerbuch B, Bar-Noy A, Linial N, Peleg D (1990) Improved routing strategies with succinct tables. J Algorithms 11(3):307–341
3. Awerbuch B, Peleg D (1990) Sparse partitions. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp 503–513
4. Blesa MJ, Xhafa F (2000) A c++ implementation of tabu search for k- cardinality tree problem based on generic programming and component reuse. Young Researchers Workshop, Citeseer
5. Blum C, Blesa MJ (2005) New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Comput Oper Res 32(6):1355–1377