李宪越，兰州大学

Given a graph G with weight function w and an acyclic edge subset E', the partial inverse spanning tree problem on (G, w; E') is to find a new weight function w* so that E' can be extended to a maximum/minimum spanning tree or a min-max spanning tree of G with respect to w* and the difference between w and w* can be minimized. In this talk, I will introduce some results on partial inverse spanning tree problems. In detail, I first introduce some results on partial inverse maximum/minimum spanning tree problem. Then, I introduce some results on partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance.