A minimization problem is called fixed parameter ρinapproximable, for a function ρ ≥ 1, if there does not exist an algorithm that given a problem instance I with optimum value opt and an integer k, either finds a feasible solution of value at most ρ(k) ·k or finds a certificate that k < opt in time t(k) · |I| for some function t. For maximization problem the definition is similar. We motivate t...