{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:28:06Z","timestamp":1747153686090,"version":"3.40.5"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T00:00:00Z","timestamp":1620777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T00:00:00Z","timestamp":1620777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Junta de Extremadura\/FEDER","award":["IB18023","GR18023"],"award-info":[{"award-number":["IB18023","GR18023"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00373-021-02325-6","type":"journal-article","created":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T10:03:05Z","timestamp":1620813785000},"page":"1385-1403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Spanning Trees in Normed Planes"],"prefix":"10.1007","volume":"37","author":[{"given":"Javier","family":"Alonso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4242-0145","authenticated-orcid":false,"given":"Pedro","family":"Mart\u00edn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,12]]},"reference":[{"key":"2325_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams\u2014a survery of a fundamental geometric data structure. ACM Comput. Surv. (CSUR) 23, 345\u2013405 (1991)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"2325_CR2","doi-asserted-by":"crossref","unstructured":"Asano, T., Bhattacharya, B., Keil, M., Yao, F.: Clustering algorithms based on minimum and maximum spanning trees. In: Proc. 4th ACM Symposium on Computational Geometry, pp. 252\u2013257 (1988)","DOI":"10.1145\/73393.73419"},{"key":"2325_CR3","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/BF01934440","volume":"22","author":"H Edelsbrunner","year":"1982","unstructured":"Edelsbrunner, H., Mauer, H.A., Preparata, F.P., Rosenberg, A.L., Welzl, E., Wood, D.: Stabbing line segments. BIT 22, 274\u2013281 (1982)","journal-title":"BIT"},{"key":"2325_CR4","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometric problems. In: Proc. 16th ACM Symposium on Theory of Computing, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"2325_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0925-7721(96)00022-3","volume":"8","author":"J Hagauer","year":"1997","unstructured":"Hagauer, J., Rote, G.: Three-clustering of points in the plane. Comput. Geom. 8, 87\u201395 (1997)","journal-title":"Comput. Geom."},{"key":"2325_CR6","first-page":"1","volume":"10","author":"T Jahn","year":"2015","unstructured":"Jahn, T.: On bisectors in normed planes. Contrib. Discrete Math. 10, 1\u20139 (2015)","journal-title":"Contrib. Discrete Math."},{"key":"2325_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52055-4","volume-title":"Concrete and Abstract Voronoi Diagrams. Lecture Notes in Computer Science","author":"R Klein","year":"1989","unstructured":"Klein, R.: Concrete and Abstract Voronoi Diagrams. Lecture Notes in Computer Science, vol. 400. Springer, New York (1989)"},{"key":"2325_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0925-7721(93)90033-3","volume":"3","author":"R Klein","year":"1993","unstructured":"Klein, R., Mehlhorn, K., Meiser, S.: Randomized incremental construction of abstract Voronoi diagrams. Comput. Geom. Theory Appl. 3, 157\u2013184 (1993)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2325_CR9","unstructured":"Lee, D.T.: Farthest Neighbor Voronoi Diagrams and Applications. North-western University, Department of Electrical Engineering and Computer Science (1980)"},{"issue":"78","key":"2325_CR10","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.comgeo.2018.10.004","volume":"78","author":"P Mart\u00edn","year":"2019","unstructured":"Mart\u00edn, P., Y\u00e1nez, D.: Geometric clustering in normed planes. Comput. Geom. Theory Appl. 78(78), 50\u201360 (2019)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2325_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0723-0869(01)80025-6","volume":"19","author":"H Martini","year":"2001","unstructured":"Martini, H., Swanepoel, K.J., Weiss, G.: The geometry of Minkowski spaces\u2014a survey. Part I Expositiones Math. 19, 97\u2013142 (2001)","journal-title":"Part I Expositiones Math."},{"key":"2325_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1142\/S0218195901000663","volume":"11","author":"K Mehlhorn","year":"2001","unstructured":"Mehlhorn, K., Meiser, S., Rasch, R.: Furthest site abstract Vornoi diagrams. Int. J. Comput. Geom. Appl. 11, 583\u2013616 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"2325_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":"2325_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)"},{"key":"2325_CR15","doi-asserted-by":"crossref","unstructured":"Shamos, M.I., Hoey, D.: Closest-point problems. In: Foundations of Computer Science, 1975, 16th Annual Symposium on, pp. 151\u2013162 (1975)","DOI":"10.1109\/SFCS.1975.8"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02325-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02325-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02325-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T07:10:07Z","timestamp":1625037007000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02325-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["2325"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02325-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,5,12]]},"assertion":[{"value":"7 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}