نتایج جستجو برای: minimum spanning tree mst
تعداد نتایج: 367940 فیلتر نتایج به سال:
The shared broadcast tree (SBT) problem in Euclidean graphs resembles the minimum spanning tree (MST) problem, but differs from MST in the definition of the objective function. The SBT problem is known to be NP-hard. In the current work, we analyse how closely the MST-solution approximates the SBT-solution, and we prove in particular that the approximation ratio is at least 6. Further, we condu...
OPTIMIZATION OF TREE-STRUCTURED GAS DISTRIBUTION NETWORK USING ANT COLONY OPTIMIZATION: A CASE STUDY
An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-alloc...
A fundamental problem in wireless networks is the minimum spanning tree (MST) problem: given a set V of wireless nodes, compute a spanning tree T , so that the total cost of T is minimized. In recent years, there has been a lot of interest in the physical interference model based on SINR constraints. Distributed algorithms are especially challenging in the SINR model, because of the non-localit...
Genetic Algorithm (GA) and other Evolutionary Algorithms (EAs) have been successfully applied to solve constrained minimum spanning tree (MST) problems of the communication network design and also have been used extensively in a wide variety of communication network design problems. Choosing an appropriate representation of candidate solutions to the problem is the essential issue for applying ...
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning tree. We show in this paper that if G is sufficiently highly edge connected then the expected length of a minimum spanning tree is ∼ nr ζ(3). If we omit the edge connectivity condition, then it is at most ∼ nr (ζ(3) +...
Let G = (V, E) be a connected undirected graph, where V = {1, . . . , n} is the set of nodes and E the set of edges. Consider that there are associated positive costs, ce, to each edge e ∈ E. Given a positive integer valued function d : V → N on the nodes, the Min-Degree Constrained Minimum Spanning Tree (md-MST) problem consists in finding a spanning tree T of G with minimum total edge cost, g...
The minimum spanning tree. Consider the complete graph, Kn, on vertices labelled by {1, 2, . . . , n}. Put independent random weights on the edges which are uniformly distributed on [0, 1] and find the spanning tree Mn of smallest total weight; this is the so-called minimum spanning tree (MST). Now think of Mn as a metric space by taking the metric to be the graph distance divided by n. We also...
Minimum Spanning Trees of weighted graphs are fundamental objects in numerous applications. In particular in distributed networks, the minimum spanning tree of the network is often used to route messages between network nodes. Unfortunately, while being most efficient in the total cost of connecting all nodes, minimum spanning trees fail miserably in the desired property of approximately preser...
Microarrays enable biologists to study genome-wide patterns of gene expression in any given cell type at any given time and under any given set of conditions. Identifying group of genes that manifest similar expression pattern is important in the analysis of gene expression in time series data. In this paper multidimensional gene expression data is represented using Minimum Spanning Tree (MST)....
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T ) = O(k · n) · w(MST (M)), and a spanning tree T ′ with weight w(T ′) = O(k) · w(MST (M)) and unweighted diameter O(k · n). These trees also achieve an optimal maximum degree. Furthermore, we demonstrate that these trees can be constructed efficiently...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید