Clustering to Minimize the Maximum Intercluster Distance

[1]  David B. Shmoys,et al.  Powers of graphs: A powerful approximation technique for bottleneck problems , 1984, STOC '84.

[2]  Teofilo F. Gonzalez,et al.  On the computational complexity of clustering and related problems , 1982 .

[3]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[4]  P. Brucker.  On the Complexity of Clustering Problems , 1978 .

[5]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[8]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[9]  M. Shamos.  Geometry and statistics: problems at the interface , 1976 .

[10]  Gerard Salton,et al.  Dynamic information and library processing , 1975 .

[11]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[12]  H. Bezdek.  Reverberation at 75 kHz to a depth of 1 km in the Pacific Ocean—a negligible factor in attenuation , 1973 .

[13]  Lawrence Bodin,et al.  A graph theoretic approach to the grouping of ordering data , 1972, Networks.

[14]  William S. Meisel,et al.  Computer-oriented approaches to pattern recognition , 1972 .

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[16]  J. V. Ness,et al.  Admissible clustering procedures , 1971 .

[17]  Gerard Salton,et al.  The SMART Retrieval System—Experiments in Automatic Document Processing , 1971 .

[18]  Jack Minker,et al.  An Analysis of Some Graph Theoretical Cluster Techniques , 1970, JACM.

[19]  Walter D. Fisher.  On Grouping for Maximum Homogeneity , 1958 .