The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
On the hardness of approximating minimization problems
Open accessAbstract
We prove results indicating that it is hard to compute efficiently good approximate solutions to the Graph Coloring, Set Covering and other related minimization problems.Specifically, there is an E > 0 such that Graph Coloring cannot be approximated with ratio n' unless P = NP.Set Covering cannot be approximated with ratio c log n for any c < l/4 unless NP is contained in DTIME(nP"Y'"~").Similar results follow for related problems such as Clique Cover, Fractional Chromatic Number, Dominating Set, and others.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
A Greedy Heuristic for the Set-Covering Problem
Chvatal, V. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.3.233 · Cited by 2,581
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
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
Self-citationOn the ratio of optimal integral and fractional covers
Lovász, L. (1975) · Discrete Mathematics · doi:10.1016/0012-365x(75)90058-8 · Cited by 1,114
Proof verification and hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267823 · Cited by 741
Self-citationSimple Constructions of Almost k‐wise Independent Random Variables
Alon, N., Goldreich, O., Håstad, J., & Peralta, R. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030308 · Cited by 556
Approximating clique is almost NP-complete
Feige, U., Goldwasser, S., Lovasz, L., Safra, S., & Szegedy, M. (2002) · [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science · doi:10.1109/sfcs.1991.185341 · Cited by 396
The Complexity of Near-Optimal Graph Coloring
Garey, M. R., & Johnson, D. S. (1976) · Journal of the ACM · doi:10.1145/321921.321926 · Cited by 326
Efficient probabilistically checkable proofs and applications to approximations
Bellare, M., Goldwasser, S., Lund, C., et al. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167174 · Cited by 317
Self-citationContentment in graph theory: Covering graphs with cliques
Orlin, J. (1977) · Indagationes Mathematicae (Proceedings) · doi:10.1016/1385-7258(77)90055-5 · Cited by 275
A still better performance guarantee for approximate graph coloring
Halldórsson, M. M. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90246-6 · Cited by 224
Optimization, approximation, and complexity classes
Papadimitriou, C., & Yannakakis, M. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62233 · Cited by 208
Self-citationComplexity of Computer Computations
Rice, J. R., Miller, R. E., & Thatcher, J. W. (1974) · Mathematics of Computation · doi:10.2307/2005950 · Cited by 205
Non deterministic polynomial optimization problems and their approximations
Paz, A., & Moran, S. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90081-5 · Cited by 183
Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
Dobson, G. R. (1982) · Mathematics of Operations Research · doi:10.1287/moor.7.4.515 · Cited by 182
Two-prover one-round proof systems: Their power and their problems
Feige, U., & Lovász, L. (1992) · Symposium on the Theory of Computing · Cited by 181
The approximation of maximum subgraph problems
Lund, C., & Yannakakis, M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56939-1_60 · Cited by 175
Self-citationTwo-prover one-round proof systems: their power and their problems (extended abstract)
Feige, U., & Lovász, L. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129783 · Cited by 161
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Yannakakis, M. (1979) · Journal of the ACM · doi:10.1145/322154.322157 · Cited by 63
Self-citationOn the Greedy Heuristic for Continuous Covering and Packing Problems
Fisher, M. L., & Wolsey, L. A. (1982) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0603059 · Cited by 48
Some tools for approximate 3-coloring
Blum, A. L. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89576 · Cited by 37
On the complexity of approximating the independent set problem
Berman, P., & Schnitger, G. (1989) · Lecture notes in computer science · doi:10.1007/bfb0028990 · Cited by 30
Cited by
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
Proof verification and the hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998) · Journal of the ACM · doi:10.1145/278298.278306 · Cited by 1,413
Self-citationThe Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Probabilistic checking of proofs: a new characterization of NP
Arora, S., & Safra, S. (1998) · Journal of the ACM · doi:10.1145/273865.273901 · Cited by 1,153
Metadata
- Authors
- Lund, C., & Yannakakis, M.
- Venue
- Journal of the ACM
- Published
- 1994-09
- Volume
- 41
- Issue
- 5
- Pages
- 960-981
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2059453880
- Cited by
- 872
- References
- 25
- FWCI
- 25.70
- 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.