The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
The planark-means problem is NP-hard
Open accessOverview
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
Cites
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
CBMS-NSF REGIONAL CONFERENCE SERIES IN APPLIED MATHEMATICS
Gottlieb, D., Orszag, S. A., Huber, P. J., & Roberts, F. S. (2011) · Cited by 999
NP-hardness of Euclidean sum-of-squares clustering
Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (2009) · Machine Learning · doi:10.1007/s10994-009-5103-0 · Cited by 867
Planar Formulae and Their Uses
Lichtenstein, D. (1982) · SIAM Journal on Computing · doi:10.1137/0211025 · Cited by 769
Clustering Large Graphs via the Singular Value Decomposition
Petros Drineas, B., FRIEZE, A. M., Kannan, R., Vempala, S., & Vinay, V. (2004) · Machine Learning · doi:10.1023/b:mach.0000033113.59016.96 · Cited by 487
A local search approximation algorithm for k-means clustering
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · Proceedings of the eighteenth annual symposium on Computational geometry · doi:10.1145/513400.513402 · Cited by 474
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548458 · Cited by 449
Universality considerations in VLSI circuits
Valiant, L. G. (1981) · IEEE Transactions on Computers · doi:10.1109/tc.1981.6312176 · Cited by 396
An Algorithmic Theory of Numbers, Graphs and Convexity
Lovász, L. (1986) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970203 · Cited by 358
Inaba, M., Katoh, N., & Imai, H. (1994) · Proceedings of the tenth annual symposium on Computational geometry - SCG '94 · doi:10.1145/177424.178042 · Cited by 321
How slow is the k -means method?
Arthur, D., & Vassilvitskii, S. (2006) · Proceedings of the twenty-second annual symposium on Computational geometry · doi:10.1145/1137856.1137880 · Cited by 304
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
Ostrovsky, R., Rabani, Y., Schulman, L., & Swamy, C. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.75 · Cited by 261
A Simple Linear Time (1+ ∊) -Approximation Algorithm for k-Means Clustering in Any Dimensions
Kumar, A., Sabharwal, Y., & Sen, S. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.7 · Cited by 247
Approximation schemes for clustering problems
de la Véga, W. F., Karpiński, M., Mathieu, C., & Rabani, Y. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780550 · Cited by 163
Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method
Arthur, D., & Vassilvitskii, S. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.79 · Cited by 64
How fast is the k-means method?
Har-Peled, S., & Sadri, B. (2005) · Symposium on Discrete Algorithms · doi:10.5555/1070432.1070555 · Cited by 44
Cited by
A comparative study of efficient initialization methods for the k-means clustering algorithm
Celebi, M. E., Kingravi, H. A., & Vela, P. A. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.07.021 · Cited by 1,214
K-means properties on six clustering benchmark datasets
Fränti, P., & Sieranoja, S. (2018) · Applied Intelligence · doi:10.1007/s10489-018-1238-7 · Cited by 518
The MADlib analytics library: or MAD skills, the SQL
Hellerstein, J. M., Ré, C., Schoppmann, F., Wang, D. Z., Fratkin, E., Gorajek, A., Ng, K. S., Welton, C., Feng, X., Li, K., et al. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367510 · Cited by 373
Reinforcement Learning in Multiple-UAV Networks: Deployment and Movement Design
Liu, X., Liu, Y., & Chen, Y. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2922849 · Cited by 342
Metadata
- Authors
- Mahajan, M., Nimbhorkar, P., & Varadarajan, K.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2012-07
- Volume
- 442
- Pages
- 13-21
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2160039585
- Cited by
- 277
- References
- 17
- FWCI
- 13.60
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.