{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:45:59Z","timestamp":1740109559993,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T00:00:00Z","timestamp":1549411200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004836","name":"Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF-0602-02499B"],"award-info":[{"award-number":["DFF-0602-02499B"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"crossref","award":["024.002.003","612.001.207"],"award-info":[{"award-number":["024.002.003","612.001.207"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["022.005025","612.001.118"],"award-info":[{"award-number":["022.005025","612.001.118"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00454-019-00059-0","type":"journal-article","created":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T05:59:00Z","timestamp":1549432740000},"page":"483-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Perimeter-Sum Partitions in the Plane"],"prefix":"10.1007","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2734-4690","authenticated-orcid":false,"given":"Mikkel","family":"Abrahamsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehran","family":"Mehr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali D.","family":"Mehrabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,6]]},"reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamsen, M., Adamaszek, A., Bringmann, K., Cohen-Addad, V., Mehr, M., Rotenberg, E., Roytman, A., Thorup, M.: Fast fencing. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC\u201918), pp. 564\u2013573. ACM, New York (2018)","DOI":"10.1145\/3188745.3188878"},{"key":"59_CR2","unstructured":"Abrahamsen, M., de\u00a0Berg, M., Buchin, K., Mehr, M., Mehrabi, A.D.: Minimum perimeter-sum partitions in the plane. In: Aronov, B., Katz, M.J. (eds.) Proceedings of the 33rd International Symposium on Computational Geometry (SoCG\u201917), Article No. 4. LIPIcs. Leibniz International Proceedings in Informatics, vol. 77. Schloss Dagstuhl, Leibniz-Zentrum f\u00fcr Informatik, Wadern (2017)"},{"issue":"4","key":"59_CR3","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comput. Surv. 30(4), 412\u2013458 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"59_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF01769706","volume":"10","author":"EM Arkin","year":"1993","unstructured":"Arkin, E.M., Khuller, S., Mitchell, J.S.B.: Geometric knapsack problems. Algorithmica 10(5), 399\u2013427 (1993)","journal-title":"Algorithmica"},{"key":"59_CR5","doi-asserted-by":"crossref","unstructured":"Asano, T., Bhattacharya, B., Keil, M., Yao, F.: Clustering algorithms based on minimum and maximum spanning trees. In: Proceedings of the 4th Annual Symposium on Computational Geometry (SoCG\u201988), pp. 252\u2013257. ACM, New York (1988)","DOI":"10.1145\/73393.73419"},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2016.11.014","volume":"718","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., Cho, H.-G., Evans, W., Saeedi, N., Shin, C.-S.: Covering points with convex sets of minimum size. Theor. Comput. Sci. 718, 14\u201323 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"59_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0196-6774(91)90007-L","volume":"12","author":"V Capoyleas","year":"1991","unstructured":"Capoyleas, V., Rote, G., Woeginger, G.: Geometric clusterings. J. Algorithms 12(2), 341\u2013356 (1991)","journal-title":"J. Algorithms"},{"issue":"2","key":"59_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"TM Chan","year":"1999","unstructured":"Chan, T.M.: More planar two-center algorithms. Comput. Geom. 13(2), 189\u2013198 (1999)","journal-title":"Comput. Geom."},{"key":"59_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"issue":"1","key":"59_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1142\/S0218195999000042","volume":"9","author":"O Devillers","year":"1999","unstructured":"Devillers, O., Katz, M.J.: Optimal line bipartitions of point sets. Int. J. Comput. Geom. Appl. 9(1), 39\u201351 (1999)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"59_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/trsc.18.4.351","volume":"18","author":"Z Drezner","year":"1984","unstructured":"Drezner, Z.: The planar two-center and two-median problems. Transp. Sci. 18(4), 351\u2013361 (1984)","journal-title":"Transp. Sci."},{"key":"59_CR12","unstructured":"Eppstein, D.: Faster construction of planar two-centers. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201917), pp. 131\u2013138. ACM, New York (1997)"},{"key":"59_CR13","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms. Mathematical Surveys and Monographs, vol.\u00a0173. American Mathematical Society, Providence (2011)","DOI":"10.1090\/surv\/173"},{"issue":"2","key":"59_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0925-7721(92)90028-Q","volume":"2","author":"J Hershberger","year":"1992","unstructured":"Hershberger, J.: Minimizing the sum of diameters efficiently. Comput. Geom. 2(2), 111\u2013118 (1992)","journal-title":"Comput. Geom."},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Jaromczyk, J.W., Kowaluk, M.: An efficient algorithm for the Euclidean two-center problem. In: Proceedings of the 10th ACM Symposium on Computational Geometry (SoCG\u201994), pp. 303\u2013311. ACM, New York (1994)","DOI":"10.1145\/177424.178038"},{"issue":"2","key":"59_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01840442","volume":"1","author":"DT Lee","year":"1986","unstructured":"Lee, D.T., Wu, Y.F.: Geometric complexity of some location problems. Algorithmica 1(2), 193\u2013211 (1986)","journal-title":"Algorithmica"},{"key":"59_CR17","unstructured":"Mitchell, J.S.B., Wynters, E.L.: Finding optimal bipartitions of points and polygons. In: Dehne, F., et al. (eds.) Algorithms and Data Structures (WADS\u201991). Lecture Notes in Computer Science, vol. 519, pp. 202\u2013213. Springer, Berlin (1991). \nhttp:\/\/www.ams.sunysb.edu\/~jsbm\/"},{"key":"59_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-94776-1_13","volume-title":"Computing and Combinatorics (COCOON\u201918)","author":"E Oh","year":"2018","unstructured":"Oh, E., Ahn, H.-K.: Polygon queries for convex hulls of points. In: Wang, L., Zhu, D. (eds.) Computing and Combinatorics (COCOON\u201918). Lecture Notes in Computer Science, vol. 10976, pp. 143\u2013155. Springer, Cham (2018)"},{"key":"59_CR19","unstructured":"Rokne, J., Wang, S., Wu, X.: Optimal bipartitions of point sets. In: Proceedings of the 4th Canadian Conference on Computational Geometry (CCCG\u201992), pp. 11\u201316. Memorial University of Newfoundland, St. John\u2019s (1992)"},{"issue":"1","key":"59_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1015670603203","volume":"1","author":"M Segal","year":"2002","unstructured":"Segal, M.: Lower bounds for covering problems. J. Math. Model. Algorithms 1(1), 17\u201329 (2002)","journal-title":"J. Math. Model. Algorithms"},{"issue":"2","key":"59_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00009311","volume":"18","author":"M Sharir","year":"1997","unstructured":"Sharir, M.: A near-linear algorithm for the planar 2-center problem. Discrete Comput. Geom. 18(2), 125\u2013134 (1997)","journal-title":"Discrete Comput. Geom."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-019-00059-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00059-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00059-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T19:09:37Z","timestamp":1580929777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-019-00059-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s00454-019-00059-0","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2019,2,6]]},"assertion":[{"value":"31 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}