Computational Aspects of Some Algorithms for The Multiperiod Degree Constrained Minimum Spanning Tree Problem

Given a graph G(V,E), where V is the set of vertices and E is the set of edges connecting vertices in V, and for every edge e_ij there is an associated weight c_ij ≥0, The Multi Period Degree Constrained Minimum Spanning Tree (MPDCMST) is a problem of finding an MST while also considering the degree constrained on every vertex, and satisfying vertices installation on every period. The restriction on the vertex installation is needed due to some conditions such as fund limitation, harsh weather, and so on. In this research some algorithms developed to solve the MPDCMST Problem will be discussed and compared.