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

Authors

29K

  1. JN
    Joseph Naor

    Technion – Israel Institute of Technology, Israel

    56 publications · 4.2K citations

    38

    h-index

  2. MC
    Moses Charikar

    Princeton University, United States

    52 publications · 9.4K citations

    38

    h-index

  3. PI
    Piotr Indyk

    Massachusetts Institute of Technology, United States

    64 publications · 14.2K citations

    37

    h-index

  4. RR
    R. Ravi

    Carnegie Mellon University, United States

    59 publications · 3.6K citations

    36

    h-index

  5. DP
    David P. Woodruff

    IBM Research - Almaden, United States

    75 publications · 5K citations

    35

    h-index

1–5 of 29K

Venues

  1. SIAM Journal on Computing

    519 publications · 56.7K citations

    117

    h-index

  2. Journal of the ACM

    JACM · 180 publications · 43.8K citations

    83

    h-index

  3. Mathematical Programming

    277 publications · 27.1K citations

    76

    h-index

  4. Mathematics of Computation

    MCOM · 272 publications · 29.5K citations

    73

    h-index

  5. arXiv (Cornell University)

    Repository · 963 publications · 30.1K citations

    70

    h-index

1–5