Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs

Given a connected vertex-weighted graph G, the maximum weight internal spanning tree (MaxwIST) problem asks for a spanning tree of G that maximizes the total weight of internal nodes. This problem is NP-hard and APX-hard, with the currently best known approximation factor 1/2 (Chen et al., Algorithmica 2019). For the case of claw-free graphs, Chen et al. present an involved approximation algorithm with approximation factor 7/12. They asked whether it is possible to improve these ratios, in particular for claw-free graphs and cubic graphs. For cubic graphs we present an algorithm that computes a spanning tree whose total weight of internal vertices is at least34−3n times the total weight of all vertices, where n is the number of vertices of G. This ratio is almost tight for large values of n. For claw-free graphs of degree at least three, we present an algorithm that computes a spanning tree whose total internal weight is at least35−1n times the total vertex weight. The degree constraint is necessary as this ratio may not be achievable if we allow vertices of degree less than three. With the above ratios, we immediately obtain better approximation algorithms with factors34− ϵand 35 − ϵ for the MaxwIST problem in cubic graphs and claw-free graphs having no degree-2 vertices, for any ϵ > 0. The new algorithms are short (compared to that of Chen et al.) and fairly simple as they employ a variant of the depth-first search algorithm. Moreover, they take linear time while previous algorithms for similar problem instances are super-linear. © 2022, Brown University. All rights reserved.