On the analysis of ant colony optimization for the maximum independent set problem

Xiaoyun XIA; Xue PENG; Weizhi LIAO

doi:10.1007/s11704-020-9464-7

Front. Comput. Sci. ›› 2021, Vol. 15 ›› Issue (4) : 154329 DOI: 10.1007/s11704-020-9464-7

LETTER

On the analysis of ant colony optimization for the maximum independent set problem

Author information +

History +

PDF (204KB)

Cite this article

Download citation ▾

Xiaoyun XIA, Xue PENG, Weizhi LIAO. On the analysis of ant colony optimization for the maximum independent set problem. Front. Comput. Sci., 2021, 15(4): 154329 DOI:10.1007/s11704-020-9464-7

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	Neumann F, Witt C. Bioinspired Computation in Combinatorial Optimization — Algorithms and Their Computational Complexity. Springer Science & Business Media, 2010

[2]	Zhou Z H, Yu Y, Qian C. Evolutionary Learning: Advances in Theories and Algorithms.Singapore: Springer, 2019

[3]	Garey M R, Johnson D S. Computers and Intractability: A Guide to The Theory of NP-completeness.New York, NY: Freeman, 1979

[4]	Pat A. Ant colony optimization and hypergraph covering problems. In: Proceedings of the IEEE Congress on Evolutionary Computation. 2014, 1714–1720

[5]	Xia X, Zhou Y. Performance analysis of ACO on the quadratic assignment problem. Chinese Journal of Electronics, 2018, 27(1): 26–34

[6]	K�tzing T, Neumann F, Roglin H. Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence, 2012, 6: 1–21

[7]	Khanna S, Motwani R, Sudan M, Vazirani U. On syntactic versus computational views of approximability. In: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science. 1994, 819–836