{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T11:28:04Z","timestamp":1775647684856,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10878-022-00915-5","type":"journal-article","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T17:40:26Z","timestamp":1664386826000},"page":"3595-3610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A local search 4\/3-approximation algorithm for the minimum 3-path partition problem"],"prefix":"10.1007","volume":"44","author":[{"given":"Yong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4283-3396","authenticated-orcid":false,"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Longcheng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bing","family":"Su","sequence":"additional","affiliation":[]},{"given":"Weitian","family":"Tong","sequence":"additional","affiliation":[]},{"given":"Yao","family":"Xu","sequence":"additional","affiliation":[]},{"given":"An","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"915_CR1","doi-asserted-by":"crossref","unstructured":"Chen Y, Goebel R, Lin G, Liu L, Su B, Tong W, Xu Y, Zhang A (2019a) A local search 4\/3-approximation algorithm for the minimum 3-path partition problem. In: Proceedings of FAW 2019, LNCS, vol 11458, pp 14\u201325","DOI":"10.1007\/978-3-030-18126-0_2"},{"key":"915_CR2","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 (2019b) An improved approximation algorithm for the minimum 3-path partition problem. J Comb Optim 38:150\u2013164","journal-title":"J Comb Optim"},{"key":"915_CR3","unstructured":"Chen Y, Goebel R, Su B, Tong W, Xu Y, Zhang A (2019c) A 21\/16-approximation for the minimum 3-path partition problem. In: Proceedings of ISAAC 2019, LIPIcs, vol 149, pp 46:1\u201346:20"},{"key":"915_CR4","doi-asserted-by":"crossref","unstructured":"Duh R, F\u00fcrer M (1997) 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","DOI":"10.1145\/258533.258599"},{"key":"915_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of for approximating set cover. J ACM 45:634\u2013652","journal-title":"J ACM"},{"key":"915_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1017\/S1446181100013894","volume":"44","author":"DS Franzblau","year":"2002","unstructured":"Franzblau DS, Raychaudhuri A (2002) Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow. ANZIAM J 44:193\u2013204","journal-title":"ANZIAM J"},{"key":"915_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco"},{"key":"915_CR8","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10107-004-0505-z","volume":"100","author":"AV Goldberg","year":"2004","unstructured":"Goldberg AV, Karzanov AV (2004) Maximum skew-symmetric flows and matchings. Math Program 100:537\u2013568","journal-title":"Math Program"},{"key":"915_CR9","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson DS (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9:256\u2013278","journal-title":"J Comput Syst Sci"},{"key":"915_CR10","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Proceedings of a symposium on the complexity of computer computations. Springer, Boston","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"915_CR11","doi-asserted-by":"crossref","unstructured":"Levin A (2006) Approximating the unweighted k-set cover problem: greedy meets local search. In: Proceedings of the 4th international workshop on approximation and online algorithms (WAOA 2006), LNCS, vol 4368, pp 290\u2013301","DOI":"10.1007\/11970125_23"},{"key":"915_CR12","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 (2007) The path partition problem and related problems in bipartite graphs. Oper Res Lett 35:677\u2013684","journal-title":"Oper Res Lett"},{"key":"915_CR13","doi-asserted-by":"crossref","unstructured":"Raz R, Safra S (1997) A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th annual ACM symposium on theory of computing (STOC\u201997), pp 475\u2013484","DOI":"10.1145\/258533.258641"},{"key":"915_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation algorithms","author":"V Vazirani","year":"2003","unstructured":"Vazirani V (2003) Approximation algorithms. Springer, Berlin"},{"key":"915_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0166-218X(97)00012-7","volume":"78","author":"J-H Yan","year":"1997","unstructured":"Yan J-H, Chang GJ, Hedetniemi SM, Hedetniemi ST (1997) k-path partitions in trees. Discret Appl Math 78:227\u2013233","journal-title":"Discret Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00915-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00915-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00915-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T09:41:22Z","timestamp":1667036482000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00915-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,28]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["915"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00915-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,28]]},"assertion":[{"value":"19 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}