Parameterized Approximation Problems

  • Rodney G. Downey
  • Michael R. Fellows
  • Catherine McCartin
Conference paper

DOI: 10.1007/11847250_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4169)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Rodney G. Downey
    • 1
  • Michael R. Fellows
    • 2
  • Catherine McCartin
    • 3
  1. 1.Victoria UniversityWellingtonNew Zealand
  2. 2.The University of NewcastleCalaghanAustralia
  3. 3.Massey UniversityPalmerston NorthNew Zealand

Personalised recommendations