The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
On the hardness of approximating vertex cover
Open accessAbstract
We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique.To that end, one needs to develop a new proof framework, and to borrow and extend ideas from several fields.
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
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,018
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
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
Some optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Erdős, P., Ko, C., & Rado, R. (1961) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/12.1.313 · Cited by 1,705
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
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
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
Self-citationOn the hardness of approximating minimization problems
Lund, C., & Yannakakis, M. (1994) · Journal of the ACM · doi:10.1145/185675.306789 · Cited by 872
Raz, R., & Safra, S. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258641 · Cited by 834
Self-citationOn the power of unique 2-prover 1-round games
Khot, S. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.510017 · Cited by 818
Vertex cover might be hard to approximate to within 2−ε
Khot, S., & Regev, O. (2007) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.06.019 · Cited by 795
Raz, R. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795280895 · Cited by 703
Intersection Theorems for Systems of Sets
Erdös, P., & Rado, R. (1960) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-35.1.85 · Cited by 626
The influence of variables on Boolean functions
Kahn, J., Kalai, G., & Linial, N. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21923 · Cited by 620
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
Bellare, M., Goldreich, O., & Sudan, M. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539796302531 · Cited by 453
Every monotone graph property has a sharp threshold
Friedgut, E., & Kalai, G. (1996) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-96-03732-x · Cited by 412
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
Bar-Yehuda, R., & Even, S. (1985) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)73101-3 · Cited by 404
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
Self-citationZero Knowledge and the Chromatic Number
Feige, U., & Kilian, J. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1587 · Cited by 334
Probabilistic checking of proofs; a new characterization of NP
Arora, S., & Safra, S. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267824 · Cited by 275
Self-citationThe Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions.Preprint
Ajtai, M. (1997) · Electronic colloquium on computational complexity · Cited by 243
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates
Friedgut, E. (1998) · COMBINATORICA · doi:10.1007/pl00009809 · Cited by 237
On Russo's Approximate Zero-One Law
Talagrand, M. (1994) · The Annals of Probability · doi:10.1214/aop/1176988612 · Cited by 236
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
Micciancio, D. (2001) · SIAM Journal on Computing · doi:10.1137/s0097539700373039 · Cited by 212
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
Halperin, E. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700381097 · Cited by 209
The hardness of approximate optima in lattices, codes, and systems of linear equations
Arora, S., Babai, L., Stern, J., & Sweedyk, Z. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366815 · Cited by 187
On the power of unique 2-prover 1-round games
Khot, S. (2003) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2002.1004334 · Cited by 135
Influences of Variables and Threshold Intervals under Group Symmetries
Bourgain, J., & Kalai, G. (1997) · Geometric and Functional Analysis · doi:10.1007/s000390050015 · Cited by 70
Approximating-CVP to within almost-polynomial factors is NP-hard
Dinur, I., Kindler, G., & Safra, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743433 · Cited by 60
Self-citationThe hardness of 3-uniform hypergraph coloring
Dinur, I., Regev, O., & Smyth, C. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181880 · Cited by 36
Self-citation
Cited by
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Reinforcement learning for combinatorial optimization: A survey
Mazyavkina, N., Sviridov, S., Ivanov, S., & Burnaev, E. (2021) · Computers & Operations Research · doi:10.1016/j.cor.2021.105400 · Cited by 723
The Critical Node Detection Problem in networks: A survey
Lalou, M., Tahraoui, M. A., & Kheddouci, H. (2018) · Computer Science Review · doi:10.1016/j.cosrev.2018.02.002 · Cited by 311
Noise stability of functions with low influences: Invariance and optimality
Mossel, E., O’Donnell, R., & Oleszkiewicz, K. (2010) · Annals of Mathematics · doi:10.4007/annals.2010.171.295 · Cited by 288
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Koufogiannakis, C., & Young, N. E. (2013) · Algorithmica · doi:10.1007/s00453-012-9629-3 · Cited by 53
“VERTEX COVER 2 − ln ln Δ̂/ ln Δ̂ local ratio [30] see also [6, 24, 28, 29, 31, 34, 40, 50] SET COVER Δ LP; greedy [33, 34]; [5] Δ = maxi |{j | Aij > 0}| CIP-01 w/Aij ∈ Z≥0 maxi ∑j Aij primal-dual [10, 27] quadratic time CIP-UB Δ ellipsoid [16, 54, 55] KC-ineq.”
Metadata
- Authors
- Dinur, I., & Safra, S.
- Venue
- Annals of Mathematics
- Publisher
- Annals of Mathematics
- Published
- 2005-07-01
- Volume
- 162
- Issue
- 1
- Pages
- 439-485
- ISSN
- 0003-486X (ISSN-L)
- OpenAlex
- W2143698439
- Cited by
- 636
- References
- 33
- FWCI
- 19.45
- 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.