Load Balanced Spanning Tree with Minimum Variance

• Input: Undirected graph G = (V,E).

• Ouput: A spanning tree that minimizes the sum of the squares of the degrees of the vertices in the tree.

Previous slide

Next slide

Back to first slide

View graphic version