Abstract
We begin to analyze the relationship between classical optimization problems and parameterized complexity. We explore syntactically defined classes of optimization problems that capture some of the main issues.
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
Notes
- 1.
The appropriate reduction here is called an L-reduction. See Exercise 9.5.4.
References
S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in Proceedings of 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992, Pittsburgh, Pennsylvania, USA, 24–27 October 1992 (IEEE Comput. Soc., Los Alamitos, 1992), pp. 14–23
C. Bazgan, Schémas d’approximation et complexité paramétrée, Rapport de stage de DEA d’Informatique á Orsay, Université Paris-Sud, 1995
G. Brightwell, P. Winkler, Counting linear extensions. Order 8(3), 225–242 (1991)
G. Brightwell, P. Winkler, Counting linear extensions is #P-complete, in Proceedings of 23rd ACM Symposium on Theory of Computing (STOC ’91), New Orleans, Louisiana, USA, May 6–May 8, 1991, ed. by C. Koutsougeras, J.S. Vitter (ACM, New York, 1991), pp. 175–181
L. Cai, Fixed parameter tractability and approximation problems, Project report, June 1992
L. Cai, J. Chen, On fixed-parameter tractability and approximability of NP optimization problems. J. Comput. Syst. Sci. 54(3), 465–474 (1997)
Y. Chen, J. Flum, M. Grohe, An analysis of the W ∗-hierarchy. J. Symb. Log. 72, 513–534 (2007)
R. Downey, M. Fellows, K. Regan, Descriptive complexity and the W-hierarchy, in DIMACS Workshop on Proof Complexity and Feasible Arithmetics, April 1996, ed. by P. Beame, S. Buss. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 39 (Am. Math. Soc., Providence, 1997), pp. 119–134
H.-D. Ebbinghaus, J. Flum, Finite Model Theory (Springer, Berlin, 1995)
R. Fagin, Generalized first order spectra and polynomial-time recognizable sets, in Complexity of Computation, ed. by R. Karp. SIAM–AMS Proceedings, vol. 7 (Am. Math. Soc., Providence, 1974), pp. 43–73
R. Fagin, Finite model theory—a personal perspective. Theor. Comput. Sci. 116(1), 3–31 (1993)
J. Flum, M. Grohe, Fixed-parameter tractability, definability, and model checking. SIAM J. Comput. 31(1), 113–145 (2001)
J. Flum, M. Grohe, The parameterized complexity of counting problems, in Proceedings of 43rd Symposium on Foundations of Computer Science, FOCS 2002, Vancouver, BC, Canada, 16–19 November 2002 (IEEE Comput. Soc., Los Alamitos, 2002), pp. 538–547
J. Flum, M. Grohe, Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series (Springer, Berlin, 2006)
M. Garey, D. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)
O. Ibarra, C. Kim, Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463–468 (1975)
N. Immermann, Expressibility as a complexity measure: results and directions, in Proceedings of Second Annual Structure in Complexity Theory Conference, Cornell University, Ithaca, NY, June 16–19, 1987 (IEEE Comput. Soc., Los Alamitos, 1987), pp. 194–202
D. Johnson, A. Demers, J. Ullman, M. Garey, R. Graham, Worst case performance bounds for simple one dimensional packing algorithms. SIAM J. Comput. 3(4), 299–325 (1974)
H. Kierstead, W. Trotter, An extremal problem in recursive combinatorics. Congr. Numer. 33, 143–153 (1981)
E. Leggett, D. Moore, Optimization problems and the polynomial time hierarchy. Theor. Comput. Sci. 15, 279–289 (1981)
L. Libkin, Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series (Springer, Berlin, 2004)
R. Lipton, R. Tarjan, Applications of a planar separator theorem, in Proceedings of 18th Annual Symposium on Foundations of Computer Science, FOCS 1977, Providence, Rhode Island, USA, 31 October–1 November 1977 (IEEE Comput. Soc., Los Alamitos, 1977), pp. 162–170
C. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425–440 (1991)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Downey, R.G., Fellows, M.R. (2013). Optimization Problems, Approximation Schemes, and Their Relation to FPT . In: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-5559-1_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5559-1_9
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5558-4
Online ISBN: 978-1-4471-5559-1
eBook Packages: Computer ScienceComputer Science (R0)