INTRODUCTION TO FIXED-PARAMETER ALGORITHMS
Rolf Niedermeier · 2006
Abstract This chapter discusses three introductory examples for studying exact and fixed-parameter algorithms. It starts with the boolean Satisfiability problem and its numerous parameters, then discusses an application problem from railway optimization, and concludes with a communication problem in tree networks (Multicut in Trees). It briefly summarizes the leitmotif of parameterized algorithm design and analysis.