{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:32:19Z","timestamp":1742938339726,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319784540"},{"type":"electronic","value":"9783319784557"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78455-7_2","type":"book-chapter","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T08:53:10Z","timestamp":1521535990000},"page":"15-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Longest Spanning Tree with\u00a0Neighborhoods"],"prefix":"10.1007","author":[{"given":"Ke","family":"Chen","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Dumitrescu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0925-7721(92)90001-9","volume":"1","author":"PK Agarwal","year":"1992","unstructured":"Agarwal, P.K., Matou\u0161ek, J., Suri, S.: Farthest neighbors, maximum spanning trees and related problems in higher dimensions. Comput. Geom. 1, 189\u2013201 (1992)","journal-title":"Comput. Geom."},{"key":"2_CR2","first-page":"385","volume":"22","author":"N Alon","year":"1995","unstructured":"Alon, N., Rajagopalan, S., Suri, S.: Long non-crossing configurations in the plane. Fundam. Inf. 22, 385\u2013394 (1995)","journal-title":"Fundam. Inf."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"EM Arkin","year":"1994","unstructured":"Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discret. Appl. Math. 55, 197\u2013218 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1145\/876638.876640","volume":"50","author":"AI Barvinok","year":"2003","unstructured":"Barvinok, A.I., Fekete, S., Johnson, D.S., Tamir, A., Woeginger, G.J., Woodroofe, R.: The geometric maximum traveling salesman problem. J. ACM 50(5), 641\u2013664 (2003)","journal-title":"J. ACM"},{"key":"2_CR5","first-page":"296","volume-title":"Approximation Algorithms for NP-hard Problems","author":"M Bern","year":"1997","unstructured":"Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, pp. 296\u2013345. PWS Publishing Company, Boston (1997)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0196-6774(83)90040-8","volume":"4","author":"BK Bhattacharya","year":"1983","unstructured":"Bhattacharya, B.K., Toussaint, G.T.: Efficient algorithms for computing the maximum distance between two finite planar sets. J. Algorithms 4, 121\u2013136 (1983)","journal-title":"J. Algorithms"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/s00224-014-9591-3","volume":"56","author":"R Dorrigiv","year":"2015","unstructured":"Dorrigiv, R., Fraser, R., He, M., Kamali, S., Kawamura, A., L\u00f3pez-Ortiz, A., Seco, D.: On minimum- and maximum-weight minimum spanning trees with neighborhoods. Theory Comput. Syst. 56(1), 220\u2013250 (2015)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-010-9277-9","volume":"44","author":"A Dumitrescu","year":"2010","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Long non-crossing configurations in the plane. Discret. Comput. Geom. 44(4), 727\u2013752 (2010)","journal-title":"Discret. Comput. Geom."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Computational Geometry","author":"D Eppstein","year":"2000","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier Science, Amsterdam (2000)"},{"key":"2_CR10","unstructured":"Fekete, S.: Simplicity and hardness of the maximum traveling salesman problem under geometric distances. In: Proceedings of 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 337\u2013345. ACM\/SIAM (1999)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"JSB Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier Science, Amsterdam (2000)"},{"key":"2_CR12","first-page":"607","volume-title":"Handbook of Computational Geometry","author":"JSB Mitchell","year":"2004","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Computational Geometry, 2nd edn, pp. 607\u2013641. Chapman & Hall\/CRC, Boca Raton (2004)","edition":"2"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01840396","volume":"5","author":"C Monma","year":"1990","unstructured":"Monma, C., Paterson, M., Suri, S., Yao, F.: Computing Euclidean maximum spanning trees. Algorithmica 5, 407\u2013419 (1990)","journal-title":"Algorithmica"},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, New York (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00454-001-0029-8","volume":"26","author":"EA Ramos","year":"2001","unstructured":"Ramos, E.A.: An optimal deterministic algorithm for computing the diameter of a three-dimensional point set. Discret. Comput. Geom. 26(2), 233\u2013244 (2001)","journal-title":"Discret. Comput. Geom."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/0167-8655(93)90144-3","volume":"14","author":"JM Robert","year":"1993","unstructured":"Robert, J.M.: Maximum distance between two sets of points in $$\\mathbb{R}^d$$. Pattern Recogn. Lett. 14, 733\u2013735 (1993)","journal-title":"Pattern Recogn. Lett."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0167-8655(82)90046-0","volume":"1","author":"GT Toussaint","year":"1982","unstructured":"Toussaint, G.T., McAlear, M.A.: A simple $$O(n \\log n)$$ algorithm for finding the maximum distance between two finite planar sets. Pattern Recogn. Lett. 1, 21\u201324 (1982)","journal-title":"Pattern Recogn. Lett."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-72870-2_29","volume-title":"Algorithmic Aspects in Information and Management","author":"Y Yang","year":"2007","unstructured":"Yang, Y., Lin, M., Xu, J., Xie, Y.: Minimum spanning tree with neighborhoods. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol. 4508, pp. 306\u2013316. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72870-2_29"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78455-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:29:17Z","timestamp":1709810957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78455-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319784540","9783319784557"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78455-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/faw2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}