Crossref
journal-article
Elsevier BV
Theoretical Computer Science (78)
References
20
Referenced
1,095
10.1145/321607.321608
/ J. ACM / An analysis of some graph theoretical cluster techniques by Augustson (1970){'key': '10.1016/0304-3975(85)90224-5_BIB2', 'series-title': 'Automatische Klassifikation', 'author': 'Bock', 'year': '1974'}
/ Automatische Klassifikation by Bock (1974)10.1002/net.3230020404
/ Networks / A graph theoretic approach to the grouping of ordering data by Bodin (1972){'key': '10.1016/0304-3975(85)90224-5_BIB4', 'series-title': 'Optimizing and Operations Research', 'article-title': 'On the complexity of clustering problems', 'author': 'Brucker', 'year': '1977'}
/ Optimizing and Operations Research / On the complexity of clustering problems by Brucker (1977){'key': '10.1016/0304-3975(85)90224-5_BIB5', 'series-title': 'Pattern Classification and Scene Analysis', 'author': 'Duda', 'year': '1973'}
/ Pattern Classification and Scene Analysis by Duda (1973)10.1093/biomet/58.1.91
/ Biometrica / Admissible clustering procedures by Fisher (1971)10.1080/01621459.1958.10501479
/ JASA / On grouping for maximum homogeneity by Fisher (1958){'key': '10.1016/0304-3975(85)90224-5_BIB8', 'series-title': 'Proc. 10th IFIP Conf. on System Modeling and Optimization', 'first-page': '174', 'article-title': 'On the computational complexity of clustering and related problems', 'author': 'Gonzalez', 'year': '1981'}
/ Proc. 10th IFIP Conf. on System Modeling and Optimization / On the computational complexity of clustering and related problems by Gonzalez (1981)10.1145/321921.321926
/ J. ACM / The complexity of near-optimal graph coloring by Garey (1976){'key': '10.1016/0304-3975(85)90224-5_BIB10', 'author': 'Garey', 'year': '1980'}
by Garey (1980){'key': '10.1016/0304-3975(85)90224-5_BIB11', 'series-title': 'Fundamentals of Computer Algorithms', 'author': 'Horowitz', 'year': '1978'}
/ Fundamentals of Computer Algorithms by Horowitz (1978){'key': '10.1016/0304-3975(85)90224-5_BIB12', 'series-title': 'Proc. 1984 STOC Conf.', 'article-title': 'Powers of graphs: A powerful approximation technique for bottleneck problems', 'author': 'Hochbaum', 'year': '1984'}
/ Proc. 1984 STOC Conf. / Powers of graphs: A powerful approximation technique for bottleneck problems by Hochbaum (1984){'key': '10.1016/0304-3975(85)90224-5_BIB13', 'series-title': 'Scientific Rept. #ISR-18', 'article-title': 'Controlled single pass classification algorithm with applications to multilevel clustering', 'author': 'Johnson', 'year': '1970'}
/ Scientific Rept. #ISR-18 / Controlled single pass classification algorithm with applications to multilevel clustering by Johnson (1970){'key': '10.1016/0304-3975(85)90224-5_BIB14', 'series-title': 'RC 8569 (#37332) Res. Rept.', 'article-title': 'Single link clustering algorithms', 'author': 'Rohlf', 'year': '1980'}
/ RC 8569 (#37332) Res. Rept. / Single link clustering algorithms by Rohlf (1980){'key': '10.1016/0304-3975(85)90224-5_BIB15', 'series-title': 'Complexity of Computer Computations', 'first-page': '85', 'article-title': 'Reducibility among combinatorial problems', 'author': 'Karp', 'year': '1972'}
/ Complexity of Computer Computations / Reducibility among combinatorial problems by Karp (1972){'key': '10.1016/0304-3975(85)90224-5_BIB16', 'series-title': 'Computer-Oriented Approaches to Pattern Recognition', 'author': 'Meisel', 'year': '1972'}
/ Computer-Oriented Approaches to Pattern Recognition by Meisel (1972)10.1145/321958.321975
/ J. ACM / P-complete approximation problems by Sahni (1976){'key': '10.1016/0304-3975(85)90224-5_BIB18', 'series-title': 'The Smart Retrieval System, Experiments in Automatic Document Processing', 'author': 'Salton', 'year': '1971'}
/ The Smart Retrieval System, Experiments in Automatic Document Processing by Salton (1971){'key': '10.1016/0304-3975(85)90224-5_BIB19', 'series-title': 'Dynamic Information and Library Processing', 'author': 'Salton', 'year': '1975'}
/ Dynamic Information and Library Processing by Salton (1975){'key': '10.1016/0304-3975(85)90224-5_BIB20', 'series-title': 'Algorithms and Complexity: New Directions and Recent Results', 'first-page': '251', 'article-title': 'Geometry and statistics: Problems at the interface', 'author': 'Shamos', 'year': '1976'}
/ Algorithms and Complexity: New Directions and Recent Results / Geometry and statistics: Problems at the interface by Shamos (1976)
Dates
Type | When |
---|---|
Created | 22 years ago (Aug. 8, 2003, 3:31 a.m.) |
Deposited | 6 years, 5 months ago (March 14, 2019, 8 p.m.) |
Indexed | 1 day, 18 hours ago (Sept. 2, 2025, 6:36 a.m.) |
Issued | 40 years, 8 months ago (Jan. 1, 1985) |
Published | 40 years, 8 months ago (Jan. 1, 1985) |
Published Print | 40 years, 8 months ago (Jan. 1, 1985) |
@article{Gonzalez_1985, title={Clustering to minimize the maximum intercluster distance}, volume={38}, ISSN={0304-3975}, url={http://dx.doi.org/10.1016/0304-3975(85)90224-5}, DOI={10.1016/0304-3975(85)90224-5}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Gonzalez, Teofilo F.}, year={1985}, pages={293–306} }