1 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definiti - Dominating set - Document - PDFSEARCH.IO

First Page	Meta Content
	1 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definiti Add to Reading List Document Date: 2014-02-04 08:14:43 Open Document File Size: 276,74 KB Share Result on Facebook City Berlin / Beijing / / Company Fixed-Parameter Tractability / / Currency pence / LTL / / IndustryTerm trivial brute-force algorithms / model-checking algorithm / obvious brute-force search algorithm / typical applications / bounded search trees / approximation algorithms / / Position scientist / university official / / ProgrammingLanguage SQL / / Technology approximation algorithms / An algorithm / trivial brute-force algorithms / model-checking algorithm / relational database / obvious brute-force search algorithm / / SocialTag NP-complete problems Analysis of algorithms Computability theory Complexity classes Parameterized complexity Dominating set Time complexity Computable function Parameter Theoretical computer science

1 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definitiAdd to Reading List