Jump to ContentJump to Main Navigation
Invitation to Fixed-Parameter Algorithms$
Users without a subscription are not able to see the full content.

Rolf Niedermeier

Print publication date: 2006

Print ISBN-13: 9780198566076

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198566076.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 23 May 2019

PARAMETERIZED COMPLEXITY THEORY—A PRIMER

PARAMETERIZED COMPLEXITY THEORY—A PRIMER

Chapter:
(p.22) 3 PARAMETERIZED COMPLEXITY THEORY—A PRIMER
Source:
Invitation to Fixed-Parameter Algorithms
Author(s):

Rolf Niedermeier

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198566076.003.0003

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.

Keywords:   parameterized problem, fixed-parameter tractable, parameterized reduction, W[1] and parameterized hardness, combinatorial explosion, fixed parameter algorithmics

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .