Parameterized Approximation

Parameterized Approximation is an algorithmic framework that combines techniques from parameterized complexity and approximation algorithms to provide efficient solutions for NP-hard problems by fixing certain parameters while approximating the solution within a bounded factor.

85

Publications

3.8K

Citations

146

Authors

99

Institutions

Publications per year

2017–2026

29

Authors

146

  1. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    10 publications · 528 citations

    10

    h-index

  2. FV
    Fedor V. Fomin

    University of Bergen, Norway

    9 publications · 519 citations

    9

    h-index

  3. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    7 publications · 456 citations

    7

    h-index

  4. DM
    Dimitrios M. Thilikos

    National and Kapodistrian University of Athens, Greece

    5 publications · 335 citations

    5

    h-index

  5. PM
    Pasin Manurangsi

    University of California, Berkeley, United States

    4 publications · 93 citations

    4

    h-index

1–5 of 146

Venues

  1. Theoretical Computer Science

    8 publications · 168 citations

    8

    h-index

  2. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 5 publications · 80 citations

    5

    h-index

  3. SIAM Journal on Computing

    5 publications · 228 citations

    5

    h-index

  4. Journal of Computer and System Sciences

    5 publications · 233 citations

    5

    h-index

  5. SIAM Journal on Discrete Mathematics

    4 publications · 146 citations

    4

    h-index

1–5