Abstract
When dealing with hard computational problems (NP-complete or worse), Scientists, Engineers and other users of software provided by Computer Scientists care most about how large a problem instance a particular method is able to solve in reasonable time. In this talk, we discuss the contributions and deficiencies of current fixed parameter tractability methods within this context.
This research has been supported in part by the Natural Sciences and Engineering Research Council of Canada.
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
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
Dehne, F. (2006). FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard 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_26
Download citation
DOI: https://doi.org/10.1007/11847250_26
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)