Journal article · 2006
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms, 2(3), 473–489 · Published 1 July 2006 · DOI 10.1145/1159892.1159901
In brief
“The NP-completeness column: The many limits on approximation” is a 2006 journal article by David S. Johnson, published in ACM Transactions on Algorithms. OpenAlex counts 15 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 15
- Most cited in
- 2012 (3)
- References
- 67
- Authors
- 1
Abstract
This is the 25th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book Computers and Intractability: A Guide to the Theory of NP-Completeness , W. H. Freeman & Co., New York, 1979, hereinafter referred to… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Johnson, D. S. (2006). The NP-completeness column: The many limits on approximation. ACM Transactions on Algorithms, 2(3), 473–489. https://doi.org/10.1145/1159892.1159901
MLA 9
Johnson, David S. “The NP-completeness column: The many limits on approximation.” ACM Transactions on Algorithms, vol. 2, no. 3, 2006, pp. 473–489. https://doi.org/10.1145/1159892.1159901.
Chicago
Johnson, David S. 2006. “The NP-completeness column: The many limits on approximation.” ACM Transactions on Algorithms 2 (3): 473–489. https://doi.org/10.1145/1159892.1159901.
Harvard
Johnson, D. S. (2006) ‘The NP-completeness column: The many limits on approximation’, ACM Transactions on Algorithms, 2(3), pp. 473–489. doi:10.1145/1159892.1159901.
IEEE
D. S. Johnson, “The NP-completeness column: The many limits on approximation,” ACM Transactions on Algorithms, vol. 2, no. 3, pp. 473–489, 2006, doi: 10.1145/1159892.1159901.
BibTeX
@article{johnson2006completeness,
title = {{The NP-completeness column: The many limits on approximation}},
author = {Johnson, David S.},
journal = {ACM Transactions on Algorithms},
year = {2006},
volume = {2},
number = {3},
pages = {473--489},
doi = {10.1145/1159892.1159901},
url = {https://doi.org/10.1145/1159892.1159901}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2012 | 3 | |
| 2013 | 1 | |
| 2014 | 1 | |
| 2015 | 1 | |
| 2016 | 1 | |
| 2017 | 1 | |
| 2018 | 2 | |
| 2019 | 1 | |
| 2023 | 2 | |
| 2025 | 1 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- NP-completeness
- approximation lower bounds
- approximation guarantees
- NP-hard optimization
- computational intractability
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Johnson, D. S. (2006). The NP-completeness column: The many limits on approximation. ACM Transactions on Algorithms, 2(3), 473–489. https://doi.org/10.1145/1159892.1159901
How many times has this paper been cited?
15 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
David S. Johnson.
What is the DOI of this paper?
10.1145/1159892.1159901. The permanent link is https://doi.org/10.1145/1159892.1159901.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.