The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Polynomial time approximation schemes for dense instances of NP-hard problems
Abstract
Article Polynomial time approximation schemes for dense instances of NP-hard problems Share on Authors: Sanjeev Arora Princeton University Princeton UniversityView Profile , David Karger MIT Laboratory for Computer Science, AT&T Bell Laboratories MIT Laboratory for Computer Science, AT&T Bell LaboratoriesView Profile , Marek Karpinski University of Bonn University of BonnView Profile Authors Info & Claims STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computingMay 1995 Pages 284–293https://doi.org/10.1145/225058.225140Online:29 May 1995Publication History 120citation1,159DownloadsMetricsTotal Citations120Total Downloads1,159Last 12 Months4Last 6 weeks1 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
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Optimization, approximation, and complexity classes
Papadimitriou, C. H., & Yannakakis, M. (1991) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(91)90023-x · Cited by 1,653
Cited by
Property testing and its connection to learning and approximation
Goldreich, O., Goldwasser, S., & Ron, D. (1998) · Journal of the ACM · doi:10.1145/285055.285060 · Cited by 1,020
Feige, U., Peleg, D., & Kortsarz, G. (2001) · Algorithmica · doi:10.1007/s004530010050 · Cited by 592
Quick Approximation to Matrices and Applications
Frieze, A., & Kannan, R. (1999) · Combinatorica · doi:10.1007/s004930050052 · Cited by 502
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., & Tsiarli, M. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487645 · Cited by 294
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2017) · Quantum · doi:10.22331/q-2017-04-25-8 · Cited by 191
Metadata
- Authors
- Arora, S., Karger, D., & Karpinski, M.
- Venue
- Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 284-293
- OpenAlex
- W2027048490
- Cited by
- 199
- References
- 2
- FWCI
- 7.56
- 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: Polynomial time approximation schemes for dense instances of NP-hard problems. https://app.cochat.ai/papers/10.1145/225058.225140
- The paper
- Arora, S., Karger, D., & Karpinski, M. (1995). Polynomial time approximation schemes for dense instances of NP-hard problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95. https://doi.org/10.1145/225058.225140
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.
