The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Approximation schemes for Euclidean k-medians and related problems
Abstract
Article Approximation schemes for Euclidean k-medians and related problems Share on Authors: Sanjeev Arora Princeton University Princeton UniversityView Profile , Prabhakar Raghavan IBM Almaden Research Center, 650 Harry Road, San Jose CA IBM Almaden Research Center, 650 Harry Road, San Jose CAView Profile , Satish Rao NEC Research Institute, Princeton, NJ NEC Research Institute, Princeton, NJView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 106–113https://doi.org/10.1145/276698.276718Published:23 May 1998 210citation1,443DownloadsMetricsTotal Citations210Total Downloads1,443Last 12 Months66Last 6 weeks10 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
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
Cites
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Probabilistic approximation of metric spaces and its algorithmic applications
Bartal, Y. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548477 · Cited by 635
Greedy strikes back: Improved Facility Location Algorithms
Guha, S., & Khuller, S. (1998) · Cited by 515
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
Self-citatione-approximations with minimum packing constraint violation (extended abstract)
Lin, J.-H., & Vitter, J. S. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129787 · Cited by 215
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63248-4_5 · Cited by 136
Self-citationMathematical Programming in Data Mining
Mangasarian, O. L. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009735908398 · Cited by 129
Approximation algorithms for geometric problems
Bern, M. W., & Eppstein, D. (1996) · Cited by 118
Cited by
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Arora, S. (1998) · Journal of the ACM · doi:10.1145/290179.290180 · Cited by 1,137
Self-citationFacility location models for distribution system design
Klose, A., & Drexl, A. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2003.10.031 · Cited by 965
Clustering data streams: theory and practice
Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198387 · Cited by 882
Metadata
- Authors
- Arora, S., Raghavan, P., & Rao, S.
- Venue
- Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 106-113
- OpenAlex
- W1977541023
- Cited by
- 341
- References
- 9
- FWCI
- 8.02
- Type
- conference paper
- 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: Approximation schemes for Euclidean k-medians and related problems. https://app.cochat.ai/papers/10.1145/276698.276718
- The paper
- Arora, S., Raghavan, P., & Rao, S. (1998). Approximation schemes for Euclidean k-medians and related problems. Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98. https://doi.org/10.1145/276698.276718
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.