{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:35Z","timestamp":1771036355859,"version":"3.50.1"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032002808","type":"print"},{"value":"9783032002815","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-00281-5_8","type":"book-chapter","created":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:25Z","timestamp":1754825905000},"page":"104-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Two-Squirrel Problem and\u00a0Its Relatives"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[]},{"given":"Yuya","family":"Higashikawa","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Kozma","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Lafond","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]},{"given":"Yuki","family":"Tokuni","sequence":"additional","affiliation":[]},{"given":"Max","family":"Willert","sequence":"additional","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. J. ACM 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1111\/j.1749-6632.1985.tb14564.x","volume":"440","author":"F Chung","year":"1985","unstructured":"Chung, F., Graham, R.L.: A new lower bound for Euclidean Steiner minimal trees. Annals. NY Academy of Sciences 440(1), 328\u2013346 (1985)","journal-title":"Annals. NY Academy of Sciences"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"G.\u00a0Even, N.\u00a0Garg, J. Koenemann, R. Ravi and A. Sinha. Covering graphs using trees and stars. Proc. APPROX\/RANDOM\u201903, pp. 24-35, 2003","DOI":"10.1007\/978-3-540-45198-3_3"},{"key":"8_CR4","unstructured":"B.\u00a0Gamlath and V.\u00a0Grinberg. Approximating star cover problems. Proc. APPROX\/RANDOM\u201920, pp. 57:1-57:19, 2020"},{"key":"8_CR5","unstructured":"M.\u00a0Garey and D.\u00a0Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness, W.H.Freeman, 1979"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"R.M.\u00a0Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pp. 85-103, Springer US, 1972","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"J Mitchell","year":"1999","unstructured":"Mitchell, J.: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems. SIAM J. Comput. 28(4), 1298\u20131309 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"D.\u00a0Wojtczak. On strong NP-completeness of rational numbers. Proc. CSR\u201918, pp. 308-320, 2018","DOI":"10.1007\/978-3-319-90530-3_26"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"W.\u00a0Zhao and P.\u00a0Zhang. Approximation to the Minimum Rooted Star Cover Problem. Proc. TAMC\u201907, pp. 670-679, 2007","DOI":"10.1007\/978-3-540-72504-6_61"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry, Graphs, and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00281-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T16:00:39Z","timestamp":1757347239000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00281-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,11]]},"ISBN":["9783032002808","9783032002815"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00281-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,11]]},"assertion":[{"value":"11 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCDCGGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry, Graphs, and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.alg.cei.uec.ac.jp\/itohiro\/JCDCGG\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}