Approximation Schemes

An Approximation Scheme is a systematic algorithmic framework within the class of approximation algorithms that generates, for any fixed precision parameter, a solution whose value is within a specified factor of the optimal, with the distinguishing feature that it allows arbitrary improvement in accuracy at the cost of increased computational time.

1.4K

Publications

91.3K

Citations

2.6K

Authors

991

Institutions

Publications per year

2017–2026

188

Authors

2.6K

  1. KJ
    Klaus Jansen

    Christian-Albrechts-Universität zu Kiel, Germany

    12 publications · 714 citations

    12

    h-index

  2. SA
    Sanjeev Arora

    Princeton University, United States

    12 publications · 3.5K citations

    12

    h-index

  3. MK
    Marek Karpiński

    University of Bonn, Germany

    10 publications · 732 citations

    10

    h-index

  4. ER
    Espen R. Jakobsen

    Norwegian University of Science and Technology, Norway

    7 publications · 693 citations

    7

    h-index

  5. GD
    G. D. Taylor

    Colorado State University, United States

    7 publications · 178 citations

    7

    h-index

1–5 of 2.6K

Venues

  1. SIAM Journal on Numerical Analysis

    38 publications · 2K citations

    27

    h-index

  2. The Journal of Chemical Physics

    30 publications · 1.5K citations

    21

    h-index

  3. Mathematics of Computation

    MCOM · 24 publications · 1.9K citations

    20

    h-index

  4. Journal of Approximation Theory

    41 publications · 1.1K citations

    20

    h-index

  5. arXiv (Cornell University)

    Repository · 31 publications · 729 citations

    19

    h-index

1–5