minimum-cost spanning tree
Cost monotonicity, consistency and minimum cost spanning tree games
... Notice that in the example mentioned above, it makes sense for town B to demand some compensation from A in order to let A use its own link to the power plant. But, how much should A agree to pay? This is where both ...
36
MoL 2013 09: The Iterative Minimum Cost Spanning Tree Problem
... direct cost to the source join early and the ones with relatively low direct cost to the source join ...same cost to the source. In network structure II the cost of the constructed network in ...
117
The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
... case of multiple sources. Rosenthal (1987) and Kuipers (1997) study a situation slightly different from this paper, whereas Berganti˜ nos et al. (2017) study the same situation as we present here. Rosenthal (1987) ...
24
A monotonic and merge proof rule in minimum cost spanning tree situations
... of minimum cost spanning tree problems, by Berganti˜ nos and Vidal-Puga ...of minimum cost spanning tree problems by Branzei et ...different cost matrices, ...
31
The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources
... In this paper we introduce minimum cost spanning tree problems with multiple sources. This new setting is an extension of the classical model where there is a single source. We extend several ...
39
The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources
... the cost of a coalition S is the minimum cost of connecting all members in S to some sources under the assumption that S is allowed to use nodes outside of ...classical minimum cost ...
33
The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
... The folk solution and Boruvka’s algorithm in minimum cost spanning tree problems Bergantiños, Gustavo and Vidal-Puga, Juan Research Group in Economic Analisys, Universidade de Vigo.[r] ...
23
Cost additive rules in minimum cost spanning tree problems with multiple sources
... a tree is obtained, its associated cost has to be shared among the ...classical minimum cost spanning tree problems include Bird (1976), Kar (2002), Dutta and Kar (2004), ...
12
Reliability Evaluation of the Minimum Spanning Tree on Uncertain Graph
... Abstract: Minimum spanning tree is a minimum-cost spanning tree connecting the whole network, but it couldn't be directly obtained on uncertain ...all minimum ...
12
Characterization of the painting rule for multi source minimal cost spanning tree problems
... multi-source cost spanning tree ...additivity, cost monotonicity, symmetry, isolated agents, and equal treatment of source ...classical minimum cost spanning tree ...
13
AN INNOVATIVE TECHNIQUE IN DATA STRUCTURE TO FIND MINIMUM SPANNING TREE OF GRAPH
... the Minimum spanning tree is the tree in the graph which connects all the nodes in the graph without maintaining any cycle and the sum of weights of all the edges are least than any other ...
7
An efficient delay-constrained minimum spanning tree heuristic
... delay-constrained spanning tree. The second phase reduces the cost of that tree by replacing tree link with cheaper links not in the tree without violating the imposed delay ...
16
Application Of Graph Theory To Find Optimal Path And Minimized Cost For The Transportation Problem
... finding minimum spanning tree and the shortest distance between two place using ...the minimum distance and the minimum cost of transporting a product from place A to place B ...
9
To Find Energy Efficient Protocol by using Minimum Spanning Tree
... HexDD[17] (Hexagonal cell-based Data Dissemination), makes hexagonal grid structure to transmit information to numerous mobile sinks. Sink information inquiry will be answered by the nodes in focal point of the cell. At ...
6
Searching Minimum Spanning Tree in a Type-2 Fuzzy Graph
... In the above example we have find the MSTs of a crisp and a fuzzy graph respectively. We observe that in both the cases the corresponding MSTs constitute the same arcs i.e. . Henceforth, we compare the deterministic ...
16
An algorithmic approach for finding minimum spanning tree in a intuitionistic fuzzy graph
... a spanning tree that has the lowest possible ...a spanning tree T of graph G which has the minimum cost among all the spanning tree of graph ...(time, cost, ...
10
A Stock Market Filtering Model Based on Minimum Spanning Tree in Financial Networks
... In the present paper, focusing on financial networks, we developed a market network filtering model using correlation - based networks to filter the stock indices (nodes) rather than the linkages (edges). The main ...
9
Minimum Spanning Tree of Imprecise Points Under $L_1$-metric
... designing VLSI circuits [12]. Therefore, it is important to compute MST under impre- cision. Obviously computing a lower and upper bound for the weight of MST as the best and worst case, estimate the cost of the ...
12
Minimum Spanning Tree with Rough Weights
... A spanning tree of G is a subset of edges T E such that |T| = |V| -1 and the sub-graph G’ = (V, T) is ...the spanning tree of a graph is the minimal subset of edges that spans all vertices ...
6
Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem
... lower cost edge. Secondly, the heuristics maintain a sorted cost matrix and searching for a low cost edge to ap- pend a vertex v to the BDST in the n/10 elements of the cost matrix row entry ...
12