{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:14Z","timestamp":1725663614737},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572732"},{"type":"electronic","value":"9783540480327"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","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":[[1993]]},"DOI":"10.1007\/3-540-57273-2_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:36:27Z","timestamp":1330259787000},"page":"192-199","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Three-clustering of points in the plane"],"prefix":"10.1007","author":[{"given":"Johann","family":"Hagauer","sequence":"first","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"17_CR1","unstructured":"Te. Asano, B. Bhattacharya, M. Keil, and F. Yao: Clustering algorithms based on minimum and maximum spanning trees. In: Proc. 4th Ann. Symp. Comput. Geometry (1988), pp. 252\u2013257"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0196-6774(91)90007-L","volume":"12","author":"V. Capoyleas","year":"1991","unstructured":"V. Capoyleas, G. Rote, and G. Woeginger: Geometric clusterings. J. Algorithms 12 (1991), 341\u2013356","journal-title":"J. Algorithms"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1109\/TIT.1983.1056714","volume":"IT-29","author":"H. Edelsbrunner","year":"1983","unstructured":"H. Edelsbrunner, D. G. Kirkpatrick, and R. Seidel: On the shape of a set of points in the plane. IEEE Trans. Inform. Theory IT-29 (1983), 551\u2013559","journal-title":"IEEE Trans. Inform. Theory"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0925-7721(92)90028-Q","volume":"2","author":"J. Hershberger","year":"1992","unstructured":"J. Hershberger: Minimizing the sum of diameters efficiently. Comput. Geom. Theory Appl. 2 (1992), 111\u2013118","journal-title":"Comput. Geom. Theory Appl."},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0196-6774(91)90013-O","volume":"12","author":"J. Hershberger","year":"1991","unstructured":"J. Hershberger and S. Suri: Finding Taylored Partitions. J. Algorithms 12 (1991), 431\u2013463","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms\u2014ESA '93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57273-2_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:19:08Z","timestamp":1558268348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57273-2_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572732","9783540480327"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-57273-2_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}