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
Parents
85
Parameterized Complexity and Approximation Algorithms
Dániel Marx · The Computer Journal · 2007 · 287 citations
Adaptive precision setting for cached approximate values
Chris Olston, Boon Thau Loo, Jennifer Widom · 2001 · 191 citations · Full text
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems
Gramm, Niedermeier, Rossmanith · Algorithmica · 2003 · 190 citations
1–5 of 85
146
10
h-index
9
h-index
7
h-index
National and Kapodistrian University of Athens, Greece
5 publications · 335 citations
5
h-index
4
h-index
1–5 of 146
99
University of Bergen
Bergen, Norway
13 h-index
31 publications
1.3K citations

Institute of Mathematical Sciences
Chennai, India
10 h-index
12 publications
859 citations
University of California, Berkeley
Berkeley, United States
5 h-index
5 publications
107 citations
Charles University
Prague, Czechia
4 h-index
6 publications
81 citations

University of Warsaw
Warsaw, Poland
4 h-index
9 publications
303 citations
Friedrich Schiller University Jena
Jena, Germany
4 h-index
11 publications
201 citations

Hungarian Academy of Sciences
Budapest, Hungary
3 h-index
5 publications
110 citations
Technische Universität Berlin
Berlin, Germany
3 h-index
4 publications
109 citations
1–8 of 99
8 publications · 168 citations
8
h-index
Repository · 5 publications · 80 citations
5
h-index
5 publications · 228 citations
5
h-index
5 publications · 233 citations
5
h-index
4 publications · 146 citations
4
h-index
1–5