given a tree with n+1 nodes, and choose m nodes, so that the defined ‘pacel costs’ are minimum. How to solve the problem?
Here is the description of this algorithm problem, and the input size are also listed below:
enter image description here
Here is the description of this algorithm problem, and the input size are also listed below:
enter image description here