Abstract
We study the problem of finding a minimum weight connected subgraph spanning at least k vertices on planar, node-weighted graphs. We give a (4 + epsil......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
