The DOI matches its Crossref record.
On the Complexity of Clustering Problems
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
Cluster analysis and mathematical programming
Hansen, P., & Jaumard, B. (1997) · Mathematical Programming · doi:10.1007/bf02614317 · Cited by 646
Why so many clustering algorithms: a position paper
Estivill-Castro, V. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568575 · Cited by 600
Practical data-oriented microaggregation for statistical disclosure control
Domingo-Ferrer, J., & Mateo-Sanz, J. M. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.979982 · Cited by 576
Sharma, G., & Trussell, H. J. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.597268 · Cited by 440
Metadata
- Authors
- Brucker, P.
- Venue
- Lecture Notes in Economics and Mathematical Systems
- Publisher
- Springer Berlin Heidelberg
- Published
- 1978
- Pages
- 45-54
- ISSN
- 0075-8442 (ISSN-L)
- OpenAlex
- W2106231890
- Cited by
- 266
- References
- 0
- FWCI
- 2.75
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Complexity of Clustering Problems. https://app.cochat.ai/papers/10.1007/978-3-642-95322-4_5
- The paper
- Brucker, P. (1978). On the Complexity of Clustering Problems. Lecture Notes in Economics and Mathematical Systems. https://doi.org/10.1007/978-3-642-95322-4_5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.