Let G be a undirected graph with weighted edges. I want to find a connected subgraph which has at most L nodes(vertices) whose sum of edges is maximum. It sounds similar to MWCS or PCST but here only the edges are weighted and there is a limit on no of nodes in the subgraph. These are related papers I found for solving MWCS or PCST: http://dimacs11.cs.princeton.edu/workshop/ElKebirKlau.pdf http://dimacs11.cs.princeton.edu/workshop/AlthausBlumenstock.pdf
PS: All weights are positive unlike in MWCS.