Delta-Approximable NP-Hard Optimisation Problem

computation approximation

Definition

$\delta$-Approximable NP-Hard Optimisation Problem

An NP-hard optimisation problem $\Pi$ is called $\delta$-approximable if it admits a factor-delta approximation algorithm