Author:
Zhang Jianping,Zhou Hong,Gao Huimin
Funder
National Natural Science Foundation of China
Natural Science Foundation of Zhejiang Province
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Software
Reference37 articles.
1. Bilò, V., Flammini, M.: On the IP routing tables minimization with addresses reassignments. In: Proceedings, 18th International Parallel and Distributed Processing Symposium (IPDPS), pp. 19–26 (2004)
2. Bilò, V., Goyal, V., Ravi, R., Singh, M.: On the crossing spanning tree problem. Proceedings. In: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 51–60. Springer, Berlin (2004)
3. Fürer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, pp. 317–324 (1992)
4. Witt, C.: Worst-case and average-case approximations by simple randomized search heuristics. In: Proceedings of the 22th Symposium on Theoretical Aspects of Computer Science Proceedings (STACS05). Lecture Notes on Computer Science, vol. 3404, pp. 44–56. Springer, Heidelberg (2005)
5. Zhou, Y., Zhang, J., Wang, Y.: Performance analysis of the (1 + 1) evolutionary algorithm for the multiprocessor scheduling problem. Algorithmica 73(1), 21–41 (2015)