Since \(w\)  is a submodular, the above is an instance of submodular function maximization subject to cardinality constraints, for which the greedy algorithm is known to yield a \((1 - 1/e)\) -approximation guarantee (Exercise 2.10 [1]}).
