{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:52:43Z","timestamp":1778662363882,"version":"3.51.4"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s11704-020-9464-7","type":"journal-article","created":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T15:31:20Z","timestamp":1621956680000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On the analysis of ant colony optimization for the maximum independent set problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Xiaoyun","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhi","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,25]]},"reference":[{"key":"9464_CR1","doi-asserted-by":"crossref","unstructured":"Neumann F, Witt C. Bioinspired Computation in Combinatorial Optimization \u2014 Algorithms and Their Computational Complexity. Springer Science & Business Media, 2010","DOI":"10.1007\/978-3-642-16544-3"},{"key":"9464_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9","volume-title":"Evolutionary Learning: Advances in Theories and Algorithms","author":"Z H Zhou","year":"2019","unstructured":"Zhou Z H, Yu Y, Qian C. Evolutionary Learning: Advances in Theories and Algorithms. Singapore: Springer, 2019"},{"key":"9464_CR3","volume-title":"Computers and Intractability: A Guide to The Theory of NP-completeness","author":"M R Garey","year":"1979","unstructured":"Garey M R, Johnson D S. Computers and Intractability: A Guide to The Theory of NP-completeness. New York, NY: Freeman, 1979"},{"key":"9464_CR4","doi-asserted-by":"crossref","unstructured":"Pat A. Ant colony optimization and hypergraph covering problems. In: Proceedings of the IEEE Congress on Evolutionary Computation. 2014, 1714\u20131720","DOI":"10.1109\/CEC.2014.6900294"},{"issue":"1","key":"9464_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1049\/cje.2017.06.004","volume":"27","author":"X Xia","year":"2018","unstructured":"Xia X, Zhou Y. Performance analysis of ACO on the quadratic assignment problem. Chinese Journal of Electronics, 2018, 27(1): 26\u201334","journal-title":"Chinese Journal of Electronics"},{"key":"9464_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11721-011-0059-7","volume":"6","author":"T K\u00f6tzing","year":"2012","unstructured":"K\u00f6tzing T, Neumann F, Roglin H. Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence, 2012, 6: 1\u201321","journal-title":"Swarm Intelligence"},{"key":"9464_CR7","unstructured":"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\u2013836"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-9464-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-020-9464-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-9464-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T04:21:09Z","timestamp":1699071669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-020-9464-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["9464"],"URL":"https:\/\/doi.org\/10.1007\/s11704-020-9464-7","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,25]]},"assertion":[{"value":"25 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"154329"}}