Incremental Network Design with Minimum Spanning Trees
Abstract
Given an edge-weighted graph G=(V,E) and a set E0⊂ E, the incremental network design problem with minimum spanning trees asks for a sequence of edges e'1,…,e'T∈ E E0 minimizing Σt=1Tw(Xt) where w(Xt) is the weight of a minimum spanning tree Xt for the subgraph (V,E0\e'1,…,e't\) and T= E E0. We prove that this problem can be solved by a greedy algorithm.
0