Abstract: Abstract This chapter introduces basic concepts which are necessary for an understanding of this subject, beginning with a close look at parameterized algorithmics. It briefly highlights the central aspects of the theory, defining parameterized problems, fixed-parameter tractability, parameterized reductions, and the parameterized complexity class W[1] representing parameterized hardness. In addition, it also indicates the limitations of the theory, focussing on different sorts of combinatorial explosions.
Publication Year: 2006
Publication Date: 2006-02-02
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot