1. To appreciate the rich landscape of optimization problems. NP optimization problems, iden- tical in terms of exact solvability, can appear very dierent from the approximation point of view. This sheds light on why, in practice, some optimization problems (such as Knapsack) are easy, while others (like Clique) are extremely dicult
msra(2009)
关键词
optimization problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络