Minimize Maximum Component Cost
Delete edges from a connected weighted graph so that at most k components remain. A component costs as much as its heaviest edge, or 0 with no edges; make the largest component cost as small as possible.
Delete edges from a connected weighted graph so that at most k components remain. A component costs as much as its heaviest edge, or 0 with no edges; make the largest component cost as small as possible.