Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bazgan, C.: Schemas d’approximation et complexite parametree. Rapport de DEA, Universite Paris Sud (1995)
Cai, L., Huang, X.: Fixed parameter Approximation: Conceptual Framework and Approximability Results (manuscript)
Cesati, M., Trevisan, L.: On the efficiency of polynomial approximation schemes. Information Processing Letters 64(4), 165–171 (1997)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Downey, R.G., McCartin, C.: Online Problems, Pathwidth, and Persistence. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 13–24. Springer, Heidelberg (2004)
Flum, J., Grohe, M.: The Parameterized Complexity of Counting Problems. SIAM Journal on Computing 33(4), 892–922 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)
McCartin, C.M.: Contributions to Parameterized Complexity Ph.D. Thesis, Victoria University, Wellington (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Downey, R.G., Fellows, M.R., McCartin, C. (2006). Parameterized Approximation Problems. In: Bodlaender, H.L., Langston, M.A. (eds) Parameterized and Exact Computation. IWPEC 2006. Lecture Notes in Computer Science, vol 4169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847250_11
Download citation
DOI: https://doi.org/10.1007/11847250_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39098-5
Online ISBN: 978-3-540-39101-2
eBook Packages: Computer ScienceComputer Science (R0)