{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T14:27:35Z","timestamp":1764772055778,"version":"3.46.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100018554","name":"Science and Technology Program of Gansu Province","doi-asserted-by":"publisher","award":["24JRRA847","24JRRA847","24JRRA847"],"award-info":[{"award-number":["24JRRA847","24JRRA847","24JRRA847"]}],"id":[{"id":"10.13039\/501100018554","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Joint Research Fund General Project","award":["24JRRA904","24JRRA904","24JRRA904"],"award-info":[{"award-number":["24JRRA904","24JRRA904","24JRRA904"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52362044","52362044","52362044"],"award-info":[{"award-number":["52362044","52362044","52362044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10586-025-05713-2","type":"journal-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T16:08:58Z","timestamp":1760717338000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["3-Path Vertex Cover Problem based on the Variable Neighborhood Search algorithm and the Artificial Bee Colony algorithm"],"prefix":"10.1007","volume":"28","author":[{"given":"Jingrong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yange","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xue","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"issue":"12","key":"5713_CR1","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1016\/j.dam.2011.04.008","volume":"159","author":"B Bre\u0161ar","year":"2011","unstructured":"Bre\u0161ar, B., Kardo\u0161, F., Katreni\u010d, J., et al.: Minimum k-path vertex cover. Discrete Applied Mathematics 159(12), 1189\u20131195 (2011)","journal-title":"Discrete Applied Mathematics"},{"issue":"13\u201314","key":"5713_CR2","doi-asserted-by":"publisher","first-page":"1943","DOI":"10.1016\/j.dam.2013.02.024","volume":"161","author":"B Bre\u0161ar","year":"2013","unstructured":"Bre\u0161ar, B., Jakovic, M., Katreni\u010d, J., et al.: On the vertex k-path cover. Discret. Appl. Math. 161(13\u201314), 1943\u20131949 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"5713_CR3","doi-asserted-by":"publisher","first-page":"132","DOI":"10.2298\/AADM201009007E","volume":"16","author":"R Erve\u0161","year":"2022","unstructured":"Erve\u0161, R., Tepeh, A.: 3-path vertex cover and dissociation number of hexagonal graphs. Applicable Analysis and Discrete Mathematics 16(1), 132\u2013145 (2022)","journal-title":"Applicable Analysis and Discrete Mathematics"},{"issue":"12","key":"5713_CR4","first-page":"103","volume":"57","author":"M Suo","year":"2022","unstructured":"Suo, M., Chen, J., Zhang, J.: k-path vertex cover of cartesian product graphs. Journal of Shandong University (Natural Science) 57(12), 103\u2013110 (2022)","journal-title":"Journal of Shandong University (Natural Science)"},{"key":"5713_CR5","doi-asserted-by":"crossref","unstructured":"Devi-N-S, Mane, A.C., Mishra, S.: Computational complexity of minimum p4 vertex cover problem for regular and k1, 4-free graphs. Discrete Applied Mathematics 184, 114\u2013121 (2015)","DOI":"10.1016\/j.dam.2014.10.033"},{"issue":"50","key":"5713_CR6","doi-asserted-by":"publisher","first-page":"7044","DOI":"10.1016\/j.tcs.2011.09.013","volume":"412","author":"J Tu","year":"2011","unstructured":"Tu, J., Zhou, W.: A primal-dual approximation algorithm for the vertex cover p3 problem. Theoret. Comput. Sci. 412(50), 7044\u20137048 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"5713_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ipl.2014.06.018","volume":"115","author":"J Tu","year":"2015","unstructured":"Tu, J.: A fixed-parameter algorithm for the vertex cover p3 problem. Information Processing Letters 115(2), 96\u201399 (2015)","journal-title":"Information Processing Letters"},{"issue":"10","key":"5713_CR8","doi-asserted-by":"publisher","first-page":"2103","DOI":"10.1080\/00207160.2014.881476","volume":"91","author":"Y Li","year":"2014","unstructured":"Li, Y., Tu, J.: A 2-approximation algorithm for the vertex cover p4 problem in cubic graphs. Int. J. Comput. Math. 91(10), 2103\u20132108 (2014)","journal-title":"Int. J. Comput. Math."},{"issue":"7","key":"5713_CR9","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1016\/j.disc.2015.12.006","volume":"339","author":"C Brause","year":"2016","unstructured":"Brause, C., Schiermeyer, I.: Kernelization of the 3-path vertex cover problem. Discrete Mathematics 339(7), 1935\u20131939 (2016)","journal-title":"Discrete Mathematics"},{"key":"5713_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ipl.2016.11.003","volume":"119","author":"Z Zhang","year":"2017","unstructured":"Zhang, Z., Li, X., Shi, Y., et al.: Ptas for minimum k-path vertex cover in ball graph. Information Processing Letters 119, 9\u201313 (2017)","journal-title":"Information Processing Letters"},{"key":"5713_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2016.04.043","volume":"657","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Kou, S.: Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. Theoret. Comput. Sci. 657, 86\u201397 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"5713_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.03.013","volume":"783","author":"D Tsur","year":"2019","unstructured":"Tsur, D.: Parameterized algorithm for 3-path vertex cover. Theoretical Computer Science 783, 1\u20138 (2019)","journal-title":"Theoretical Computer Science"},{"key":"5713_CR13","doi-asserted-by":"crossref","unstructured":"Tsur, D.: An $$o^*(2.619^k)$$ algorithm for 4-path vertex cover. Discrete Applied Mathematics 291, 1\u201314 (2021)","DOI":"10.1016\/j.dam.2020.11.019"},{"issue":"4","key":"5713_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-025-01285-4","volume":"49","author":"SK Jena","year":"2025","unstructured":"Jena, S.K., Subramani, K.: Analyzing the 3-path vertex cover problem in selected graph classes. J. Comb. Optim. 49(4), 1\u201324 (2025)","journal-title":"J. Comb. Optim."},{"key":"5713_CR15","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.amc.2018.12.067","volume":"349","author":"W Zhang","year":"2019","unstructured":"Zhang, W., Tu, J., Wu, L.: A multi-start iterated greedy algorithm for the minimum weight vertex cover p3 problem. Applied Mathematics and Computation 349, 359\u2013366 (2019)","journal-title":"Applied Mathematics and Computation"},{"key":"5713_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2025.113528","author":"MY Yildirim","year":"2025","unstructured":"Yildirim, M.Y., Akay, R.: An efficient grid-based path planning approach using improved artificial bee colony algorithm. Knowledge-Based Systems (2025). https:\/\/doi.org\/10.1016\/j.knosys.2025.113528","journal-title":"Knowledge-Based Systems"},{"key":"5713_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106584","volume":"165","author":"J Yuste","year":"2024","unstructured":"Yuste, J., Pardo, E.G., Duarte, A.: General variable neighborhood search for the optimization of software quality. Computers & Operations Research 165, 106584 (2024)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"5713_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cor.2012.05.009","volume":"40","author":"B Jarboui","year":"2013","unstructured":"Jarboui, B., Derbel, H., Hanafi, S., Mladenovi\u0107, Nenad: Variable neighborhood search for location routing. Computers & Operations Research 40(1), 47\u201357 (2013)","journal-title":"Computers & Operations Research"},{"key":"5713_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101518","volume":"86","author":"D Chang","year":"2024","unstructured":"Chang, D., Rao, C., Xiao, X., et al.: Multiple strategies based grey wolf optimizer for feature selection in performance evaluation of open-ended funds. Swarm and Evolutionary Computation 86, 101518 (2024)","journal-title":"Swarm and Evolutionary Computation"},{"issue":"11","key":"5713_CR20","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1016\/j.cam.2012.01.013","volume":"236","author":"W Gao","year":"2012","unstructured":"Gao, W., Liu, S., Huang, L.: A global best artificial bee colony algorithm for global optimization. J. Comput. Appl. Math. 236(11), 2741\u20132753 (2012)","journal-title":"J. Comput. Appl. Math."},{"issue":"10","key":"5713_CR21","doi-asserted-by":"publisher","first-page":"14469","DOI":"10.1007\/s10586-024-04678-y","volume":"27","author":"C Li","year":"2024","unstructured":"Li, C., Zhu, Y.: A hybrid butterfly and newton\u2013raphson swarm intelligence algorithm based on opposition-based learning. Clust. Comput. 27(10), 14469\u201314514 (2024)","journal-title":"Clust. Comput."},{"key":"5713_CR22","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K., Luo, C., Sattar, A.: Numvc: An efficient local search algorithm for minimum vertex cover. Journal of Artificial Intelligence Research 46, 687\u2013716 (2013)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5713_CR23","doi-asserted-by":"publisher","first-page":"2546","DOI":"10.1007\/s10489-018-1391-z","volume":"49","author":"MR Islam","year":"2019","unstructured":"Islam, M.R., Arif, I.H., Shuvo, R.H.: Generalized vertex cover using chemical reaction optimization. Appl. Intell. 49, 2546\u20132566 (2019)","journal-title":"Appl. Intell."},{"key":"5713_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.118714","volume":"245","author":"W Wang","year":"2020","unstructured":"Wang, W., Tian, G., Chen, M., Tao, Fei, Zhang, Chaoyong, AI-Ahmari, Abdulraham, Li, Zhiwu, Jiang, Zhigang: Dual-objective program and improved artificial bee colony for the optimization of energy-conscious milling parameters subject to multiple constraints. Journal of Cleaner Production 245, 118714 (2020)","journal-title":"Journal of Cleaner Production"},{"issue":"1","key":"5713_CR25","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10586-023-03967-2","volume":"27","author":"N Pal","year":"2024","unstructured":"Pal, N., Yadav, M.P., Yadav, D.K.: Appropriate number of analogues in analogy based software effort estimation using quality datasets. Clust. Comput. 27(1), 531\u2013546 (2024)","journal-title":"Clust. Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05713-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05713-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05713-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T14:16:20Z","timestamp":1764771380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05713-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"references-count":25,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["5713"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05713-2","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"4 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"his work does not contain any studies with human or animal participants.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"1015"}}