Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
The 2-rooted mini-max spanning forest problem is to find a spanning forest with two given root nodes on an undirected graph, such that the maximum tree cost in this forest is minimized. We introduce a branch-and-bound algorithm based on selecting nodes. On test instances up to 50 nodes the algorithm gives much better computational results than a known algorithm that is based on selecting edges. Furthermore the new algorithm can easily solve problem instances up to 80 nodes. We consider some alternative and polynomial criteria. Finally we discuss some generalizations, e.g., the problem without given root nodes, i.e., the root nodes have to be chosen.
spanning forest branch-and-bound combinatorial optimization bottleneck criterion