## Algorithms with large domination ratio

Let $P$ be an optimization problem, and let $A$ be an approximation algorithm for $P$. The domination ratio $\domr(A,n)$ is the maximum real $q$ such that the solution $x(I)$ obtained by $A$ for any instance $I$ of $P$ of size $n$ is not worse than at least a fraction $q$ of the feasible solutions of … Read more