Approximation algorithms for inner-node weighted minimum spanning trees