{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T08:14:08Z","timestamp":1745309648667,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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-3-031-49193-1_8","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"94-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Heterogeneous Rooted Tree Cover Problem"],"prefix":"10.1007","author":[{"given":"Pengxiang","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"1\u20132","key":"8_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","volume":"68","author":"I Averbakh","year":"1996","unstructured":"Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree. Discret. Appl. Math. 68(1\u20132), 17\u201332 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transp. Sci. 42(2), 127\u2013145 (2008)","journal-title":"Transp. Sci."},{"key":"8_CR3","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388. Carnegie Mellon University, Graduate School of Industrial Administration (1976)"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.orl.2003.11.010","volume":"32","author":"G Even","year":"2004","unstructured":"Even, G., Garg, N., Koemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Oper. Res. Lett. 32(4), 309\u2013315 (2004)","journal-title":"Oper. Res. Lett."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.disopt.2015.01.001","volume":"16","author":"B Farbstein","year":"2015","unstructured":"Farbstein, B., Levin, A.: Min-max cover of a graph with a small number of parts. Discret. Optim. 16, 51\u201361 (2015)","journal-title":"Discret. Optim."},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"GN Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"BL Golden","year":"2008","unstructured":"Golden, B.L., Raghavan, S., Wasil, E.A.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-77778-8"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/moor.2015.0729","volume":"41","author":"IL G\u00f8rtz","year":"2016","unstructured":"G\u00f8rtz, I.L., Molinaro, M., Nagarajan, V., Ravi, R.: Capacitated vehicle routing with nonuniform speeds. Math. Oper. Res. 41(1), 318\u2013331 (2016)","journal-title":"Math. Oper. Res."},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-24587-2_16","volume-title":"Algorithms and Computation","author":"H Nagamochi","year":"2003","unstructured":"Nagamochi, H., Okada, K.: Polynomial time 2-approximation algorithms for the minmax subtree cover problem. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 138\u2013147. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24587-2_16"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Nagamochi, H.: Approximating the minmax rooted-subtree cover problem. IEICE Trans. Fundamentals Electron. Commun. Comput. Sci. E88-A(5), 1335\u20131338 (2005)","DOI":"10.1093\/ietfec\/e88-a.5.1335"},{"issue":"8","key":"8_CR11","doi-asserted-by":"publisher","first-page":"112884","DOI":"10.1016\/j.disc.2022.112884","volume":"345","author":"S Schwartz","year":"2022","unstructured":"Schwartz, S.: An overview of graph covering and partitioning. Discret. Math. 345(8), 112884 (2022)","journal-title":"Discret. Math."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems. Methods and Applications. MOS-SIAM, Philadelphia (2014)","DOI":"10.1137\/1.9781611973594"},{"key":"8_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52824-9","volume-title":"Optimal Coverage in Wireless Sensor Networks","author":"W Wu","year":"2020","unstructured":"Wu, W., Zhang, Z., Lee, W., Du, D.Z.: Optimal Coverage in Wireless Sensor Networks. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-52824-9"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.orl.2010.02.004","volume":"38","author":"Z Xu","year":"2010","unstructured":"Xu, Z., Wen, Q.: Approximation hardness of min-max tree covers. Oper. Res. Lett. 38(3), 169\u2013173 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TC.2013.2295609","volume":"64","author":"W Xu","year":"2015","unstructured":"Xu, W., Liang, W., Lin, X.: Approximation algorithms for min-max cycle cover problems. IEEE Trans. Comput. 64(3), 600\u2013613 (2015)","journal-title":"IEEE Trans. Comput."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10878-018-0268-8","volume":"37","author":"W Yu","year":"2019","unstructured":"Yu, W., Liu, Z.: Better approximability results for min-max tree\/cycle\/path cover problems. J. Comb. Optim. 37, 563\u2013578 (2019)","journal-title":"J. Comb. Optim."}],"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-3-031-49193-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:04:03Z","timestamp":1702026243000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","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":"Hawaii, HI","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}