{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:18:59Z","timestamp":1778343539198,"version":"3.51.4"},"reference-count":0,"publisher":"National Library of Serbia","issue":"1","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministry of Education, Science and Technological Development of the Republic of Serbia","doi-asserted-by":"publisher","award":["III-44006"],"award-info":[{"award-number":["III-44006"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>In this paper an ant colony optimization (ACO) algorithm for the minimum\n   connected dominating set problem (MCDSP) is presented. The MCDSP become\n   increasingly important in recent years due to its applicability to the mobile\n   ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO\n   algorithm based on a known simple greedy algorithm that has a significant\n   drawback of being easily trapped in local optima. We have shown that by\n   adding a pheromone correction strategy and dedicating special attention to\n   the initial condition of the ACO algorithm this negative effect can be\n   avoided. Using this approach it is possible to achieve good results without\n   using the complex two-step ACO algorithm previously developed. We have tested\n   our method on standard benchmark data and shown that it is competitive to the\n   existing algorithms.<\/jats:p>","DOI":"10.2298\/csis110927038j","type":"journal-article","created":{"date-parts":[[2012,10,16]],"date-time":"2012-10-16T14:11:02Z","timestamp":1350396662000},"page":"133-149","source":"Crossref","is-referenced-by-count":82,"title":["Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem"],"prefix":"10.2298","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8167-1516","authenticated-orcid":false,"given":"Raka","family":"Jovanovic","sequence":"first","affiliation":[{"name":"Texas AM University at Qatar, Doha, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3794-3056","authenticated-orcid":false,"given":"Milan","family":"Tuba","sequence":"additional","affiliation":[{"name":"Megatrend University Belgrade, Faculty of Computer Science, Belgrade"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:30:44Z","timestamp":1685349044000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141200038J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013]]}},"URL":"https:\/\/doi.org\/10.2298\/csis110927038j","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}