Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree

Given an n -node, undirected and 2-edge-connected graph G =( V , E ) with positive real weights on its m edges, given a set of k source nodes S ⊆ V , and given a spanning tree T of G , the routing cost from S of T is the sum of the distances in T from every source s ∈ S to all the other nodes of G ....

Ausführliche Beschreibung