Approximation Hardness
Approximation Hardness is a theoretical measure in computational complexity that belongs to the class of properties characterizing the limits of approximation algorithms, specifically defined by the inherent difficulty of achieving better approximation ratios for optimization problems under standard complexity-theoretic assumptions.
663
Publications
51K
Citations
984
Authors
430
Institutions
Publications per year
2017–2026
75
Parents
663
Approximation Algorithms for NP-Hard Problems
Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text
A threshold of ln <i>n</i> for approximating set cover
Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text
Towards Sharp Inapproximability For Any 2-CSP
Per Austrin · 2007 · 1.4K citations
1–5 of 663
984
14
h-index
13
h-index
13
h-index
12
h-index
12
h-index
1–5 of 984
430
Princeton University
Princeton, United States
26 h-index
63 publications
6.5K citations
University of California, Berkeley
Berkeley, United States
24 h-index
33 publications
7.2K citations
Carnegie Mellon University
Pittsburgh, United States
21 h-index
47 publications
3.7K citations
Massachusetts Institute of Technology
Cambridge, United States
20 h-index
31 publications
5.1K citations

Tel Aviv University
Tel Aviv, Israel
17 h-index
26 publications
1.9K citations

KTH Royal Institute of Technology
Stockholm, Sweden
17 h-index
28 publications
3.3K citations

Weizmann Institute of Science
Rehovot, Israel
16 h-index
25 publications
5.2K citations
Microsoft (United States)
Redmond, United States
15 h-index
22 publications
1.2K citations
1–8 of 430
32 publications · 3.3K citations
23
h-index
26 publications · 1K citations
17
h-index
16 publications · 933 citations
15
h-index
Repository · 29 publications · 610 citations
15
h-index
17 publications · 1.4K citations
15
h-index
1–5