Approximation Algorithms
Approximation Algorithms is a class of algorithms in computer science designed to provide near-optimal solutions to computationally hard optimization problems, distinguished by their ability to guarantee solution quality within a provable factor of the optimal solution in polynomial time.
25.2K
Publications
1.6M
Citations
29K
Authors
4.5K
Institutions
Publications per year
2017–2026
4K
Parents
25.2K
A Stochastic Approximation Method
Herbert Robbins, Sutton Monro · The Annals of Mathematical Statistics · 1951 · 9.6K citations · Full text
A Limited Memory Algorithm for Bound Constrained Optimization
Richard H. Byrd, Peihuang Lu, Jorge Nocedal et al. · SIAM Journal on Scientific Computing · 1995 · 6.2K citations
Approximation capabilities of multilayer feedforward networks
Kurt Hornik · Neural Networks · 1991 · 6.1K citations
1–5 of 25.2K
29K
38
h-index
38
h-index
37
h-index
36
h-index
35
h-index
1–5 of 29K
4.5K
Massachusetts Institute of Technology
Cambridge, United States
117 h-index
918 publications
111.4K citations
Stanford University
Stanford, United States
113 h-index
731 publications
107.8K citations
University of California, Berkeley
Berkeley, United States
103 h-index
695 publications
68.6K citations
Princeton University
Princeton, United States
90 h-index
543 publications
55.2K citations

Cornell University
Ithaca, United States
84 h-index
432 publications
39K citations
Carnegie Mellon University
Pittsburgh, United States
83 h-index
669 publications
48.3K citations
Technion – Israel Institute of Technology
Haifa, Israel
77 h-index
485 publications
38K citations

Tel Aviv University
Tel Aviv, Israel
74 h-index
629 publications
34.9K citations
1–8 of 4.5K
519 publications · 56.7K citations
117
h-index
JACM · 180 publications · 43.8K citations
83
h-index
277 publications · 27.1K citations
76
h-index
MCOM · 272 publications · 29.5K citations
73
h-index
Repository · 963 publications · 30.1K citations
70
h-index
1–5