{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T04:32:15Z","timestamp":1768710735329,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819777976","type":"print"},{"value":"9789819777983","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7798-3_15","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"170-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for\u00a0the\u00a0Minimum Weight Cycle\/Path Partition Problem"],"prefix":"10.1007","author":[{"given":"Yaqi","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2017.11.031","volume":"239","author":"A Bar-Noy","year":"2018","unstructured":"Bar-Noy, A., Peleg, D., Rabanca, G., Vigan, I.: Improved approximation algorithms for weighted 2-path partitions. Discret. Appl. Math. 239, 15\u201337 (2018)","journal-title":"Discret. Appl. Math."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: 8\/7-approximation algorithm for (1,2)-TSP. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 641\u2013648 (2005)","DOI":"10.1145\/1109557.1109627"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s10878-020-00660-7","volume":"41","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Chen, Z.Z., Lin, G.H., Wang, L.S., Zhang, A.: A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41, 12\u201327 (2021)","journal-title":"J. Comb. Optim."},{"key":"15_CR4","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, CA (1979)"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(97)00097-5","volume":"63","author":"R Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for maximum packing of 3-edge paths. Inf. Process. Lett. 63(2), 63\u201367 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.disopt.2013.09.001","volume":"10","author":"R Hassin","year":"2013","unstructured":"Hassin, R., Schneider, O.: A local search algorithm for binary maximum 2-path partitioning. Discret. Optim. 10(4), 333\u2013360 (2013)","journal-title":"Discret. Optim."},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"2340003","DOI":"10.1142\/S0217595923400031","volume":"40","author":"S Li","year":"2023","unstructured":"Li, S., Yu, W.: Approximation algorithms for the maximum-weight cycle\/path packing problems. Asia-Pacific J. Oper. Res. 40(4), 2340003 (2023)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.jda.2007.01.006","volume":"6","author":"J Monnot","year":"2008","unstructured":"Monnot, J., Toulouse, S.: Approximation results for the weighted P4 partition problem. J. Discrete Algorithms 6(2), 299\u2013312 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"15_CR10","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. Theoret. Comput. Sci. 290, 2147\u20132155 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Zhao, J., Xiao, M.: Improved approximation algorithms for cycle and path packings. In: Proceedings of the International Conference and Workshops on Algorithms and Computation, pp. 179\u2013193 (2024)","DOI":"10.1007\/978-981-97-0566-5_14"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Zhao, J., Xiao, M.: An improved approximation algorithm for metric triangle packing. In: Chen, X., Li, B. (eds.) TAMC 2024. LNCS, vol. 14637, pp. 50\u201362 (2024). https:\/\/doi.org\/10.1007\/978-981-97-2340-9_5","DOI":"10.1007\/978-981-97-2340-9_5"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7798-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:06:54Z","timestamp":1726769214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7798-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819777976","9789819777983"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7798-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}