Meet the concept↗
The four techniques are greedy strategies, LP relaxation and rounding, the primal-dual schema, and local search.
Conditions: Applies to the design of approximation algorithms for NP-hard problems.
YouTubeApproximation Algorithms
6:31 – 7:26Watch this moment ↗
The four techniques are greedy strategies, LP relaxation and rounding, the primal-dual schema, and local search.
Conditions: Applies to the design of approximation algorithms for NP-hard problems.
YouTubeApproximation Algorithms
6:31 – 7:26Watch this moment ↗