Has this problem been studied before?Given a metric undirected graph G (edge lengths satisfy triangle inequality), find a set S of vertices such that MST(G[S]) is maximized, where MST(G[S]) is the minimum spanning tree of the subgraph induced by S. Has this problem been studied before? Is it NP-hard? Thanks a lot.
maximize MST(G[S]) over all induced subgraphs G[S] in a metric graph
ds.algorithms;graph algorithms;np hardness;approximation algorithms