Abstract
Proving hardness of approximation for min-sum objectives is an infamous challenge. For classic problems such as the Traveling Salesman problem, the St......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
