Delta-Approximable NP-Hard Optimisation Problem

computation approximation

Definition

-Approximable NP-Hard Optimisation Problem

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