The findings indicate that EPI is to a high degree constrained by the lack of an efficient communicative process across fragmented organizational structures throughout the entire planning process.
In this paper, we introduce and study a generalization of the degree constrained minimum spanning tree problem where we may install one of several available transmission systems (each with a different cost value) in each edge.
Last, we choose an arc set A (A1⊆A⊆A2) such that (d^_{A} v =m_{1} v =m v -m_{2} v)), for all v∈V (Directed Degree Constrained Sandwich Problem).
In the previous work [1, 2], we employed minimum power-based minimum spanning trees and minimum power-based shortest path trees for degree constrained routing.
The multiperiod degree constrained minimal spanning tree (MDCMST) problem consists of scheduling the installation of links in a network so as to connect a set of terminal nodes to a central node with minimal present value of expenditures.
Using recent work on degree constrained network design problems (Nutov, 2008) [26], we give constant ratio approximation algorithms for various broadcast and convergecast problems, improving the previously best known approximation Ω(⌊1/logn⌋) by Elkin et al.
The problem then turns into that of b-matching (or the degree constrained subgraph problem), which has been studied fairly well starting with the pioneering work of Edmonds (1965).
The resulting architecture presents improved fault tolerance and dynamic adaptation to varying network conditions, by propagating control messages to any bot node through multiple short-range hops structured according to a dynamically built Degree Constrained Minimum Spanning Tree, whose distributed calculation is inspired to ant colony's foraging behavior.
Then we propose a solution which includes a SDN framework and an algorithm to construct a degree-constrained overlay multicast routing tree.
A general instance of a Degree-Constrained Subgraph problem may be found in an edge-weighted or vertex-weighted graph G whereas the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph.
Directed Degree Constrained Sandwich ProblemInstance: Given directed graphs D1= V,A1) and D2= V,A2) with A1⊆A2 and a non-negative integer vector f on V. Question: Does there exist a sandwich graph D= V,A) (A1⊆A⊆A2) such that (d^_{D} v =f v)) for all v∈V?
