{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:21:41Z","timestamp":1772785301782,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671135"],"award-info":[{"award-number":["11671135"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871213"],"award-info":[{"award-number":["11871213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["19ZR1411800"],"award-info":[{"award-number":["19ZR1411800"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11590-023-01989-8","type":"journal-article","created":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T04:16:47Z","timestamp":1677471407000},"page":"279-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A local search algorithm for the k-path partition problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Shiming","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6127-1264","authenticated-orcid":false,"given":"Wei","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Zhaohui","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,27]]},"reference":[{"issue":"1","key":"1989_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s10878-018-00372-z","volume":"38","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Goebel, R., Lin, G., Su, B., Xu, Y., Zhang, A.: An improved approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 38(1), 150\u2013164 (2019)","journal-title":"J. Comb. Optim."},{"key":"1989_CR2","unstructured":"Chen, Y., Goebel, R., Su, B., Tong, W., Xu, Y., Zhang, A.: A 21\/16-approximation for the minimum 3-path partition problem. In: Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC 2019), vol. 149(46), pp. 1\u201320 (2019)"},{"key":"1989_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Y., Goebel, R., Lin, G., Liu, L., Su, B., Tong, W., Xu, Y., Zhang, A.: A local search 4\/3-approximation algorithm for the minimum 3-path partition problem. In: Chen, Y., Deng, X., Lu, M. (eds.) Frontiers in Algorithmics. FAW 2019 Lecture Notes in Computer Science, vol. 11458, Springer, Cham, pp. 14\u201325 (2019)","DOI":"10.1007\/978-3-030-18126-0_2"},{"key":"1989_CR4","doi-asserted-by":"publisher","unstructured":"Chen, Y., Chen, Z., Kennedy, C., Lin, G., Xu, Y., Zhang, A.: Approximation algorithms for the directed path partition problems. In: Chen, J., Li, M., Zhang, G. (eds.) Frontiers of Algorithmics. IJTCS-FAW 2021. Lecture Notes in Computer Science, vol. 12874, Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97099-4_2","DOI":"10.1007\/978-3-030-97099-4_2"},{"key":"1989_CR5","doi-asserted-by":"crossref","unstructured":"Duh, R., Furer, M.: Approximation of $$k$$-set cover by semi-local optimization. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC\u201997, pp. 256\u2013264 (1997)","DOI":"10.1145\/258533.258599"},{"key":"1989_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"3","key":"1989_CR7","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10107-004-0505-z","volume":"100","author":"AV Goldberg","year":"2004","unstructured":"Goldberg, A.V., Karzanov, A.V.: Maximum skew-symmetric flows and matchings. Math. Program. 100(3), 537\u2013568 (2004)","journal-title":"Math. Program."},{"key":"1989_CR8","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D., Hell, P.: On the completeness of a generalized matching problem. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 240\u2013245 (1978)","DOI":"10.1145\/800133.804353"},{"key":"1989_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.endm.2018.05.009","volume":"67","author":"N Korpelainen","year":"2018","unstructured":"Korpelainen, N.: A boundary class for the k-path partition problem. Electron. Notes Discrete Math. 67, 49\u201356 (2018)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"1989_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/060655225","volume":"23","author":"A Levin","year":"2009","unstructured":"Levin, A.: Approximating the unweighted $$k$$-set cover problem: greedy meets local search. SIAM J. Discrete Math. 23(1), 251\u2013264 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"1989_CR11","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.orl.2006.12.004","volume":"35","author":"J Monnot","year":"2007","unstructured":"Monnot, J., Toulouse, S.: The path partition problem and related problems. Oper. Res. Lett. 35(5), 677\u2013684 (2007)","journal-title":"Oper. Res. Lett."},{"key":"1989_CR12","doi-asserted-by":"crossref","unstructured":"Palsetia, D., Mostofa Md., Patwary A., Hendrix W., Agrawal A., Choudhary, A.: Clique guided community detection. In: Proceedings of 2014 IEEE International Conference on Big Data, pp. 500\u2013509 (2014)","DOI":"10.1109\/BigData.2014.7004267"},{"key":"1989_CR13","first-page":"89","volume":"147","author":"G Steiner","year":"2000","unstructured":"Steiner, G.: On the k-path partition problem in cographs. Congr. Numer. 147, 89\u201396 (2000)","journal-title":"Congr. Numer."},{"issue":"3","key":"1989_CR14","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/S0304-3975(02)00577-7","volume":"290","author":"G Steiner","year":"2003","unstructured":"Steiner, G.: On the k-path partition of graphs. Theor. Comput. Sci. 290(3), 2147\u20132155 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1989_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0166-218X(97)00012-7","volume":"78","author":"J Yan","year":"1997","unstructured":"Yan, J., Chang, G., Hedetiemi, S., Hedetniemi, S.: $$k$$-Path partitions in trees. Discrete Appl. Math. 78(1), 227\u2013233 (1997)","journal-title":"Discrete Appl. Math."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01989-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-01989-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01989-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T06:23:17Z","timestamp":1704867797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-01989-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1989"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-01989-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"20 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}