The inverse spanning-tree problem is to modify edge weights in a graph so that a given tree T is a minimum spanning tree. The objective is to minimize the cost of the deviation. The cost of deviation is typically a convex function. We propose algorithms here that are faster than all known algorithms for the problem. Our algorithm's run time for any convex inverse spanning-tree problem is O(nmlog2 n) for a graph on n nodes and m edges plus the time required to find the minima of the n convex deviation functions. This not only improves on the complexity of previously known algorithms for the general problem, but also for algorithms devised for special cases. For the case when the objective is weighted absolute deviation, Sokkalingam et al. devised an algorithm with run time O(n2mlog(nC)) for C the maximum edge weight. For the sum of absolute deviations our algorithm runs in time O(n2 log n), matching the run time of a recent improvement for this case due to Ahuja and Orlin. A new algorithm for bipartite matching in path graphs is reported here with complexity of O(n1.5 log n). This leads to a second algorithm for the sum of absolute deviations running in O(n1.5 log n logC) steps.
