On Parameterized Approximability

Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is to deal with the efficient approximation of small cost solutions for optimisation problems. Key words. Fixed-parameter tractability, approximation algorithms, hardness of approximation.

• Type: Journal
• Year: 2007
• Where: ECCC
• Authors: Yijia Chen, Martin Grohe, Magdalena Grüber
• Keywords: Approximation, Classical Approximability Questions, ECCC 2007, Parameterized Approximability