Approximation algorithms for the maximum weight internal spanning tree problem

Zhi-Zhong Chen, Guohui Lin, Lusheng Wang +2

Given a vertex-weighted connected graph $G=(V,E)$, the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree $T$ of $G$ such that the total we…