Invitation to data reduction and problem kernelization
ACM SIGACT News
Parameterized approximation of dominating set problems
Information Processing Letters
Parameterized approximation scheme for the multiple knapsack problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Exponential-time approximation of weighted set cover
Information Processing Letters
Constant ratio fixed-parameter approximation of the edge multicut problem
Information Processing Letters
On the parameterized complexity of some optimization problems related to multiple-interval graphs
Theoretical Computer Science
Multiple genome alignment based on longest path in directed acyclic graphs
International Journal of Bioinformatics Research and Applications
Algorithms and theory of computation handbook
Parameterized Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A fast approximation scheme for the multiple knapsack problem
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Safe approximation and its relation to kernelization
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Approximation algorithms for scheduling and packing problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximating low-dimensional coverage problems
Proceedings of the twenty-eighth annual symposium on Computational geometry
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On approximating string selection problems with outliers
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Parameterized approximability of the disjoint cycle problem
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Completely inapproximable monotone and antimonotone parameterized problems
Journal of Computer and System Sciences
European Journal of Combinatorics
The exponential time hypothesis and the parameterized clique problem
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Efficient algorithms for the max k-vertex cover problem
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Note: The parametric complexity of graph diameter augmentation
Discrete Applied Mathematics
On approximating string selection problems with outliers
Theoretical Computer Science
Bounding the running time of algorithms for scheduling and packing problems
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Data reduction for graph coloring problems
Information and Computation
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
| Hi-index | 0.00 |
Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard algorithmic problems. In this paper, our aim is to investigate how these two fields can be combined to achieve better algorithms than what any of the two theories could offer. We discuss the different ways parameterized complexity can be extended to approximation algorithms, survey results of this type and propose directions for future research.