Abstract
Let R be a finite set of terminals in a convex metric space (M, d). We give approximation algorithms for problems of finding a minimum size set S subs......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
