Parameterized Approximation Problems
Up to now, most work in the area of parameterized complexity has focussed on exact algorithms for decision problems. The goal of this paper is to apply parameterized ideas to approximation. We begin exploration of parameterized approximation problems, where the problem in question is a parameterized decision problem, and the required approximation factor is treated as a second parameter for the problem.
Unable to display preview. Download preview PDF.
- 1.Bazgan, C.: Schemas d’approximation et complexite parametree. Rapport de DEA, Universite Paris Sud (1995)Google Scholar
- 2.Cai, L., Huang, X.: Fixed parameter Approximation: Conceptual Framework and Approximability Results (manuscript)Google Scholar
- 4.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
- 8.McCartin, C.M.: Contributions to Parameterized Complexity Ph.D. Thesis, Victoria University, Wellington (2003)Google Scholar