START WITH A QUESTION

What would you like to understand?

Find an answer. See the moment it becomes clear. Follow the idea further.

Video language

Answers for “如果 P 等于 NP，近似算法会变得过时吗？”

1 keyword matches

Related concepts

Understanding your question. You can explore the search results below now.

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.