{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T15:58:58Z","timestamp":1779119938110,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819705658","type":"print"},{"value":"9789819705665","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-0566-5_14","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"179-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Improved Approximation Algorithms for\u00a0Cycle and\u00a0Path Packings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2322-750X","authenticated-orcid":false,"given":"Jingyang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1012-2373","authenticated-orcid":false,"given":"Mingyu","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"23","author":"EM Arkin","year":"1998","unstructured":"Arkin, E.M., Hassin, R.: On local search for weighted k-set packing. Math. Oper. Res. 23(3), 640\u2013648 (1998)","journal-title":"Math. Oper. Res."},{"key":"14_CR2","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."},{"issue":"3","key":"14_CR3","first-page":"178","volume":"7","author":"P Berman","year":"2000","unstructured":"Berman, P.: A d\/2 approximation for maximum weight independent set in d-claw free graphs. Nord. J. Comput. 7(3), 178\u2013184 (2000)","journal-title":"Nord. J. Comput."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: 8\/7-approximation algorithm for (1, 2)-TSP. In: SODA 2006, pp. 641\u2013648. ACM Press (2006)","DOI":"10.1145\/1109557.1109627"},{"issue":"1","key":"14_CR5","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., Lin, G., Wang, L., Zhang, A.: A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41(1), 12\u201327 (2021)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10878-006-9023-7","volume":"13","author":"Z Chen","year":"2007","unstructured":"Chen, Z., Nagoya, T.: Improved approximation algorithms for metric MaxTSP. J. Comb. Optim. 13(4), 321\u2013336 (2007)","journal-title":"J. Comb. Optim."},{"issue":"7","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1640","DOI":"10.1016\/j.dam.2008.11.009","volume":"157","author":"Z Chen","year":"2009","unstructured":"Chen, Z., Tanahashi, R., Wang, L.: An improved randomized approximation algorithm for maximum triangle packing. Discret. Appl. Math. 157(7), 1640\u20131646 (2009)","journal-title":"Discret. Appl. Math."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Z., Tanahashi, R., Wang, L.: Erratum to \u201can improved randomized approximation algorithm for maximum triangle packing\u201d [Discrete Appl. Math. 157 (2009) 1640\u20131646]. Discret. Appl. Math. 158(9), 1045\u20131047 (2010)","DOI":"10.1016\/j.dam.2010.01.011"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-59250-3_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"S Dudycz","year":"2017","unstructured":"Dudycz, S., Marcinkowski, J., Paluch, K., Rybicki, B.: A 4\/5 - approximation algorithm for the maximum traveling salesman problem. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 173\u2013185. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_15"},{"key":"14_CR10","unstructured":"Gabow, H.N.: Implementation of algorithms for maximum matching on nonbipartite graphs. Ph.D. thesis, Stanford University (1974)"},{"issue":"2","key":"14_CR11","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":"5","key":"14_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0020-0190(01)00234-4","volume":"81","author":"R Hassin","year":"2002","unstructured":"Hassin, R., Rubinstein, S.: A 7\/8-approximation algorithm for metric max TSP. Inf. Process. Lett. 81(5), 247\u2013251 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.dam.2005.11.003","volume":"154","author":"R Hassin","year":"2006","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discret. Appl. Math. 154(6), 971\u2013979 (2006)","journal-title":"Discret. Appl. Math."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Hassin, R., Rubinstein, S.: Erratum to \u201can approximation algorithm for maximum triangle packing\u201d: [discrete applied mathematics 154 (2006) 971\u2013979]. Discret. Appl. Math. 154(18), 2620 (2006)","DOI":"10.1016\/j.dam.2006.05.005"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3), 133\u2013137 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"14_CR16","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."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., Hell, P.: On the completeness of a generalized matching problem. In: STOC 1978, pp. 240\u2013245. ACM (1978)","DOI":"10.1145\/800133.804353"},{"key":"14_CR18","first-page":"55","volume":"26","author":"A Kostochka","year":"1985","unstructured":"Kostochka, A., Serdyukov, A.: Polynomial algorithms with the estimates 3\/4 and 5\/6 for the traveling salesman problem of the maximum. Upravliaemie Syst. 26, 55\u201359 (1985)","journal-title":"Upravliaemie Syst."},{"issue":"47\u201349","key":"14_CR19","doi-asserted-by":"publisher","first-page":"5000","DOI":"10.1016\/j.tcs.2009.07.051","volume":"410","author":"L Kowalik","year":"2009","unstructured":"Kowalik, L., Mucha, M.: Deterministic 7\/8-approximation for the metric maximum TSP. Theor. Comput. Sci. 410(47\u201349), 5000\u20135009 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR20","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston (1976)"},{"issue":"04","key":"14_CR21","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-Pac. J. Oper. Res. 40(04), 2340003 (2023)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/060676003","volume":"38","author":"B Manthey","year":"2008","unstructured":"Manthey, B.: On approximating restricted cycle covers. SIAM J. Comput. 38(1), 181\u2013206 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"14_CR23","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 p$${}_{\\text{4 }}$$ partition problem. J. Discrete Algorithms 6(2), 299\u2013312 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"14_CR24","unstructured":"Neuwohner, M.: An improved approximation algorithm for the maximum weight independent set problem in d-claw free graphs. In: STACS 2021, LIPIcs, vol. 187, pp. 53:1\u201353:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-031-06901-7_31","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Neuwohner","year":"2022","unstructured":"Neuwohner, M.: The limits of local search for weighted k-set packing. In: Aardal, K., Sanit\u00e1, L. (eds.) IPCO 2022. LNCS, vol. 13265, pp. 415\u2013428. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06901-7_31"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Neuwohner, M.: Passing the limits of pure local search for weighted k-set packing. In: SODA 2023, pp. 1090\u20131137. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch41"},{"issue":"2","key":"14_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1587\/transinf.E93.D.241","volume":"93","author":"R Tanahashi","year":"2010","unstructured":"Tanahashi, R., Chen, Z.Z.: A deterministic approximation algorithm for maximum 2-path packing. IEICE Trans. Inf. Syst. 93(2), 241\u2013249 (2010)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Thiery, T., Ward, J.: An improved approximation for maximum weighted k-set packing. In: SODA 2023, pp. 1138\u20131162. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch42"},{"key":"14_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"},{"key":"14_CR30","unstructured":"Zhao, J., Xiao, M.: Improved approximation algorithms for capacitated vehicle routing with fixed capacity. CoRR abs\/2210.16534 (2022)"},{"key":"14_CR31","unstructured":"Zhao, J., Xiao, M.: Improved approximation algorithms for cycle and path packings. CoRR abs\/2311.11332 (2023)"},{"issue":"13\u201314","key":"14_CR32","doi-asserted-by":"publisher","first-page":"2142","DOI":"10.1016\/j.dam.2013.03.001","volume":"161","author":"A van Zuylen","year":"2013","unstructured":"van Zuylen, A.: Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems. Discret. Appl. Math. 161(13\u201314), 2142\u20132157 (2013)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0566-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:08:37Z","timestamp":1709654917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_14","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":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 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":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}