Qingzhen Dong

Algorithms on partial inverse min–max spanning tree problem under the l∞-norm

Given a connected edge-weighted graph G and a forest F of G , the goal of the partial inverse min–max spanning tree problem is to change the weight function as little as possible, so that there is a min–max spanning tree with respect to the new weight function containing F . In t...