{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:31:27Z","timestamp":1725568287977},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671817"},{"type":"electronic","value":"9783540465157"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-46515-7_3","type":"book-chapter","created":{"date-parts":[[2010,10,20]],"date-time":"2010-10-20T09:35:28Z","timestamp":1287567328000},"page":"30-46","source":"Crossref","is-referenced-by-count":1,"title":["Effective Use of Geometric Properties for Clustering"],"prefix":"10.1007","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Asano, T., Bhattacharya, B., Keil, J.M., Yao, F.F.: Clustering Algorithms Based on Minimum and Maximum Spanning Trees. In: Proc. of the 4th Annual ACM Symp. on Computational Geometry, pp. 252\u2013257 (1988)","DOI":"10.1145\/73393.73419"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02187699","volume":"1","author":"D. Avis","year":"1986","unstructured":"Avis, D.: Diameter Partitioning. Discrete and Computational Geometry\u00a01, 265\u2013276 (1986)","journal-title":"Discrete and Computational Geometry"},{"key":"3_CR3","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-642-95322-4_5","volume-title":"Optimization and Operations Research","author":"P. Brucker","year":"1978","unstructured":"Brucker, P.: On the Complexity of Clustering Problems. In: Henn, R., Korte, B., Oletti, W. (eds.) Optimization and Operations Research. Lecture Notes in Economics and Mathematical Systems, pp. 45\u201354. Springer, Berlin (1978)"},{"key":"3_CR4","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. of Algorithms\u00a012, 341\u2013356 (1991)","journal-title":"J. of Algorithms"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/103516.103518","volume":"38","author":"D. Dobkin","year":"1991","unstructured":"Dobkin, D., Suri, S.: Maintenance of Geometric Extrema. J. of ACM\u00a038(2), 275\u2013298 (1991)","journal-title":"J. of ACM"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Mauer, H.A., Preparata, F.P., Rosenberg, A.L., Welzl, E., Wood, D.: Stabbing Line Segments. In: BIT, vol.\u00a022, pp. 274\u2013281 (1982)","DOI":"10.1007\/BF01934440"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-57273-2_55","volume-title":"Algorithms - ESA \u201993","author":"J. Hagauer","year":"1993","unstructured":"Hagauer, J., Rote, G.: Three-Clustering of Points in the Plane. In: Lengauer, T. (ed.) ESA 1993. LNCS, vol.\u00a0726, pp. 192\u2013199. Springer, Heidelberg (1993)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Hansen, P., Jaumard, B.: Minimum sum of diameters clustering. J. of Classification, 215\u2013226 (1987)","DOI":"10.1007\/BF01896987"},{"key":"3_CR9","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. John-Wiley, New York (1975)"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0925-7721(92)90028-Q","volume":"12","author":"J. Hershberger","year":"1992","unstructured":"Hershberger, J.: Minimizing the Sum of Diameters Efficiently. Computational Geometry: Theory and Applications\u00a012, 111\u2013118 (1992)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Finding Tailored Partitions. In: Proc. of the 5th Annual ACM Symp. on Computational Geometry, pp. 255\u2013265 (1989)","DOI":"10.1145\/73833.73862"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering. In: Proc. 10th ACM Symp. on Computational Geometry, pp. 332\u2013339 (1994)","DOI":"10.1145\/177424.178042"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","volume":"3","author":"D.S. Johnson","year":"1982","unstructured":"Johnson, D.S.: The NP-Completeness Column: Ongoing Guide. J. of Algorithms\u00a03, 182\u2013195 (1982)","journal-title":"J. of Algorithms"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0166-218X(87)90006-0","volume":"17","author":"N. Katoh","year":"1987","unstructured":"Katoh, N., Ibaraki, T.: A Parametric Characterization and an \u03b5-Approximation Scheme for the Minimization of a Quasiconcave Program. Discrete Applied Mathematics\u00a017, 39\u201366 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Monma, C., Paterson, M., Suri, S., Yao, F.: Computing Euclidean Maximum Spanning Trees. In: Proc. of the 4th Annual ACM Symp. on Computational Geometry, pp. 241\u2013251 (1988)","DOI":"10.1145\/73393.73418"},{"key":"3_CR16","unstructured":"Monma, C., Suri, S.: Partitioning Points and Graphs to Minimize the Maximize or the Sum of Diameters. In: Proc. 6th International Conf. on Theory and Applications of Graphs (1988)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. Overmars","year":"1981","unstructured":"Overmars, M., van Leeuwen, J.: Maintenance of Configurations in the Plane. J. Coput. and Syst. Sci.\u00a023, 166\u2013204 (1981)","journal-title":"J. Coput. and Syst. Sci."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Selim, S.Z., Ismail, M.A.: K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality. IEEE Trans. Pattern Anal. Mach. Intell., 81\u201387 (1984)","DOI":"10.1109\/TPAMI.1984.4767478"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46515-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:03:37Z","timestamp":1558292617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46515-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671817","9783540465157"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46515-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}