Parameterized approximation problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4169 LNCS, Issue , 2006, Pages 121-129

  Downey, Rodney G ^a   Fellows, Michael R ^b   McCartin, Catherine ^c  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c MASSEY UNIVERSITY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

APPROXIMATION FACTORS; PARAMETERIZED COMPLEXITY;

APPROXIMATION THEORY;

EID: 33750233605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_11     Document Type: Conference Paper

References (8)

1. C. Bazgan: Schemas d'approximation et complexite parametree. Rapport de DEA, Universite Paris Sud, 1995.
2. L. Cai, X. Huang: Fixed parameter Approximation: Conceptual Framework and Approximability Results. Manuscript.
3. M. Cesati, L. Trevisan: On the efficiency of polynomial approximation schemes. Information Processing Letters, 64(4), pp 165-171, 1997.
4. R. G. Downey, M. R. Fellows: Parameterized Complexity Springer-Verlag, 1999.
5. R. G. Downey, C. M. McCartin: Online Problems, Pathwidth, and Persistence. Proceedings of IWPEC 2004, Springer-Verlag LNCS 3162, pp 13-24, 2004.
6. J. Flum, M. Grohe: The Parameterized Complexity of Counting Problems. SIAM Journal on Computing, 33(4), pp 892-922, 2004.
7. M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-completeness Freeman, New York, 1979.
8. C. M. McCartin: Contributions to Parameterized Complexity Ph.D. Thesis, Victoria University, Wellington, 2003.