{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T23:45:24Z","timestamp":1775000724057,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,9,3]],"date-time":"2005-09-03T00:00:00Z","timestamp":1125705600000},"content-version":"vor","delay-in-days":5208,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0196-6774(91)90007-l","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"341-356","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":68,"title":["Geometric clusterings"],"prefix":"10.1016","volume":"12","author":[{"given":"Vasilis","family":"Capoyleas","sequence":"first","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(91)90007-L_BIB1","series-title":"Proceedings Fourth Annu. Symp. Computational Geometry","first-page":"252","article-title":"Clustering algorithms based on minimum and maximum spanning trees","author":"Asano","year":"1988"},{"key":"10.1016\/0196-6774(91)90007-L_BIB2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/0216006","article-title":"Power diagrams: Properties, algorithms, and applications","volume":"16","author":"Aurenhammer","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(91)90007-L_BIB3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(89)90080-0","article-title":"On clustering problems with connected optima in Euclidean spaces","volume":"75","author":"Boros","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(91)90007-L_BIB4","series-title":"Automatische Klassifikation","author":"Bock","year":"1974"},{"key":"10.1016\/0196-6774(91)90007-L_BIB5","series-title":"Optimization and Operations Research","first-page":"45","article-title":"On the complexity of clustering problems","author":"Brucker","year":"1977"},{"key":"10.1016\/0196-6774(91)90007-L_BIB6","first-page":"741","article-title":"The p-centre problem\u2014Heuristic and optimal algorithms","volume":"35","author":"Drezner","year":"1984","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0196-6774(91)90007-L_BIB7","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0196-6774(91)90007-L_BIB8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(90)90147-A","article-title":"Covering Convex Sets with Non-overlapping Polygons","volume":"81","author":"Edelsbrunner","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(91)90007-L_BIB9","series-title":"Proceedings 20th Annu. ACM Symp. Theory Computing","first-page":"434","article-title":"Optimal algorithms for approximate clustering","author":"Feder","year":"1988"},{"key":"10.1016\/0196-6774(91)90007-L_BIB10","first-page":"62","article-title":"Some packing and covering theorems","volume":"12","author":"T\u00f3th","year":"1950","journal-title":"Acta Sci. Math. Szeged A"},{"key":"10.1016\/0196-6774(91)90007-L_BIB11","series-title":"Proceedings Fifth Annu. Symp. Computational Geometry, Saarbr\u00fccken, West Germany, June 1989","first-page":"255","article-title":"Finding tailored partitions","author":"Hershberger","year":"1989"},{"key":"10.1016\/0196-6774(91)90007-L_BIB12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0214006","article-title":"Voronoi diagrams in the Laguerre metric and its applications","volume":"14","author":"Imai","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(91)90007-L_BIB13","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","article-title":"The NP-completeness column: An ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(91)90007-L_BIB14","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","article-title":"On the complexity of some common geometric location problems","volume":"13","author":"Megiddo","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(91)90007-L_BIB15","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0167-6377(82)90039-6","article-title":"On the complexity of locating linear facilities in the plane","volume":"1","author":"Megiddo","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0196-6774(91)90007-L_BIB16","series-title":"The Theory and Applications of Graphs, Proc. Sixth Int. Conf. Theory and Appl. of Graphs, Kalamazoo, Michigan, May 1988","article-title":"Partitioning points and graphs to minimize the maximum or the sum of diameters","author":"Monma","year":"1991"},{"key":"10.1016\/0196-6774(91)90007-L_BIB17","series-title":"Computational Geometry\u2014An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0196-6774(91)90007-L_BIB18","article-title":"Topics in Computational Geometry","author":"Supowit","year":"1981"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190007L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190007L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:13:39Z","timestamp":1757463219000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749190007L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["019667749190007L"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90007-l","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Geometric clusterings","name":"articletitle","label":"Article Title"},{"value":"Journal of Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0196-6774(91)90007-L","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}