Minimum cost spanning tree problems
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
The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources
... (the cost allocation should depend only on the arcs that belong to the minimal tree), cone-wise additivity (the cost allocation should be additive on cones), symmetry (agents with the same connection ...
39
The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
... connection problems involving a single source, which contains classical minimum cost spanning tree ...a cost allocation rule, called the painting rule because it can be ...
24
The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources
... A group of agents is interested in a service provided by a supplier with multiple service stations, also called sources. Agents will be served through costly connections. They do not care whether they are connected ...
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
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 ...
31
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 algorithmic approach for finding minimum spanning tree in a intuitionistic fuzzy graph
... quality problems; after an earthquake or major disaster, the water supply network is reliable or not, urban water supply network can be normal without the occurrence of secondary disasters; pipe network not only ...
10
Application Of Graph Theory To Find Optimal Path And Minimized Cost For The Transportation Problem
... practical problems can be represented by ...finding minimum spanning tree and the shortest distance between two place using ...the minimum distance and the minimum cost of ...
9
Cost monotonicity, consistency and minimum cost spanning tree games
... or cost allocation ...general problems. For instance, it is known that the core of a minimum cost spanning tree game is always ...
36
A Clustering Algorithm Based on the Combination of MST and Cluster Centers
... Abstract. Most of traditional MST-based (Minimum spanning tree) clustering algorithms cluster by removing the inconsistent edge. The performances of these algorithms are influenced by the shape of ...
6
Minimum Spanning Tree based Clustering with Cluster Validity in Data Mining
... A spanning tree is an acyclic subgraph of a graph G, which contains all the vertices from ...The minimum spanning tree (MST) of a weighted graph is the minimum weight ...
5
Text ABSTRAK pdf
... Permasalahan jaringan pipa air dapat berkembang menjadi suatu masalah baru jika terdapat batasan-batasan lainnya. Misalnya dalam jaringan pipa-pipa tersebut memiliki batasan maksimal jumlah pipa yang dapat terhubung di ...
39
Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
... [18] proposed modification of MPDCMST problem by changing the planning horizon only one year and divided the installation process into three periods (four months each). This modification made due to real condition in ...
6
To Find Energy Efficient Protocol by using Minimum Spanning Tree
... Remote Sensor Networks (WSN) alludes to a gathering of moment, low power-driven sensor hubs that are spatially circulated to check the various environmental conditions. These sensor nodes are lightweight in nature, have ...
6
Searching Minimum Spanning Tree in a Type-2 Fuzzy Graph
... opinion of different experts, it may happen that two experts opinion about the weight of an edge differ. A type-2 fuzzy set outperforms type-1 fuzzy sets as far as modeling of these scenarios is concerned. In this paper, ...
16
A multivariate two-sample test using the Voronoi diagram
... An interesting prop erty of the Voronoi dual is that it contains a minimum spanning tree as a. subgraph[r] ...
13
Deterministic Deployment of Wireless Sensor Networks
... The topic of this paper is the most fundamental objec- tive of deployment of wireless sensor networks, namely 1-connectivity. Although it is possible to interconnect a WSN in many ways, we define 1-connectivity as the ...
6
Achieving k anonymity using Minimum Spanning Tree based Partitioning
... subtree has k data points. Once this is achieved we generalize the data points adhering to k-anonymity for publishing. The rest of the paper is organised as follows: Section 2 surveys the related work. Section 3 presents ...
9
Local Density based Hierarchical Clustering for Overlapping Distribution using Minimum Spanning Tree
... Our LDHCODMST clustering algorithm is a hierarchical algorithm based on local density information. The way the density of the probability distribution is estimated, and the use of this information in the introduced ...
5