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 “为什么贪心匹配算法能保证顶点覆盖问题的 2-近似？”

1 keyword matches

Related concepts

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

Meet the concept

FPTAS and PTAS allow arbitrarily close approximation. APX allows constant-factor approximation.

Conditions: Comparing standard approximation classes for optimization problems.