{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:06:50Z","timestamp":1757617610260,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_41","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:33:12Z","timestamp":1741105992000},"page":"505-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximately Covering Vertices by\u00a0Order-5 or\u00a0Longer Paths"],"prefix":"10.1007","author":[{"given":"Mingyang","family":"Gong","sequence":"first","affiliation":[]},{"given":"Zhi-Zhong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.20200","volume":"50","author":"K Asdre","year":"2007","unstructured":"Asdre, K., Nikolopoulos, S.D.: A linear-time algorithm for the $$k$$-fixed-endpoint path cover problem on cographs. Networks 50, 231\u2013240 (2007)","journal-title":"Networks"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.tcs.2009.11.003","volume":"411","author":"K Asdre","year":"2010","unstructured":"Asdre, K., Nikolopoulos, S.D.: A polynomial solution to the $$k$$-fixed-endpoint path cover problem on proper interval graphs. Theoret. Comput. Sci. 411, 967\u2013975 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: 8\/7-approximation algorithm for (1,2)-TSP. In: Proceedings of SODA vol. 2006, pp. 641\u2013648 (2006)","DOI":"10.1145\/1109557.1109627"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Cai, Y., et al.: Approximation algorithms for two-machine flow-shop scheduling with a conflict graph. In: Proceedings of COCOON 2018, LNCS 10976, pp. 205\u2013217 (2018)","DOI":"10.1007\/978-3-319-94776-1_18"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10878-021-00793-3","volume":"43","author":"Y Chen","year":"2022","unstructured":"Chen, Y., et al.: Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Comb. Optim. 43, 571\u2013588 (2022)","journal-title":"J. Comb. Optim."},{"key":"41_CR6","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, 150\u2013164 (2019)","journal-title":"J. Comb. Optim."},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10878-019-00488-w","volume":"39","author":"R G\u00f3mez","year":"2020","unstructured":"G\u00f3mez, R., Wakabayashi, Y.: Nontrivial path covers of graphs: existence, minimization and maximization. J. Comb. Optim. 39, 437\u2013456 (2020)","journal-title":"J. Comb. Optim."},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Gong, M., Chen, Z.-Z., Lin, G., Wang, L.: An approximation algorithm for covering vertices by $$4^+$$-paths. In: Proceedings of COCOA 2023, LNCS 14461, pp. 459\u2013470","DOI":"10.1007\/978-3-031-49611-0_33"},{"key":"41_CR9","unstructured":"Gong, M., Fan, J., Lin, G., Miyano, E.: Approximation algorithms for covering vertices by long paths. In: Proceedings of MFCS 2022, LIPIcs 241, pp. 53:1\u201353:14 (2022)"},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jgt.20161","volume":"52","author":"D Hartvigsen","year":"2006","unstructured":"Hartvigsen, D., Hell, P., Szab\u00f3, J.: The $$k$$-piece packing problem. J. Graph Theory 52, 267\u2013293 (2006)","journal-title":"J. Graph Theory"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Kobayashi, K., et al.: Path cover problems with length cost. In: Proceedings of WALCOM 2022, LNCS 13174, pp. 396\u2013408 (2022)","DOI":"10.1007\/978-3-030-96731-4_32"},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"3348","DOI":"10.1007\/s00453-023-01106-2","volume":"85","author":"K Kobayashi","year":"2023","unstructured":"Kobayashi, K., et al.: Path cover problems with length cost. Algorithmica 85, 3348\u20133375 (2023)","journal-title":"Algorithmica"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $$O(\\sqrt{|V|} |E|)$$ algorithm for finding maximum matching in general graphs. In: Proceedings of FOCS vol. 1980, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ipl.2007.12.006","volume":"107","author":"LL Pao","year":"2008","unstructured":"Pao, L.L., Hong, C.H.: The two-equal-disjoint path cover problem of matching composition network. Inf. Process. Lett. 107, 18\u201323 (2008)","journal-title":"Inf. Process. Lett."},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"S5","DOI":"10.1186\/1471-2105-15-S9-S5","volume":"15","author":"R Rizzi","year":"2014","unstructured":"Rizzi, R., Tomescu, A.I., M\u00e4kinen, V.: On the complexity of minimum path cover with subpath constraints for multi-assembly. BMC Bioinform. 15, S5 (2014)","journal-title":"BMC Bioinform."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:03:54Z","timestamp":1757142234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}