Results 1  10
of
143
Minimum Spanning Tree with Rough Weights
"... In many real world problems related to weighted graphs, the input data corresponding to the weights are often imprecise due to incomplete or nonobtainable information. Finding the minimum spanning tree of such type of connected graphs is a challenge. This paper is introduced to find minimum spannin ..."
Abstract
 Add to MetaCart
In many real world problems related to weighted graphs, the input data corresponding to the weights are often imprecise due to incomplete or nonobtainable information. Finding the minimum spanning tree of such type of connected graphs is a challenge. This paper is introduced to find minimum
The Diameterconstrained Minimum Spanning Tree
"... Spanning Tree Problem is about finding a minimum cost spanning tree, subjected to predefined constraints on the number of edges that can integrate the path between any pair of nodes. This problem typically models network design applications where all vertices must communicate with each other at a m ..."
Abstract
 Add to MetaCart
Spanning Tree Problem is about finding a minimum cost spanning tree, subjected to predefined constraints on the number of edges that can integrate the path between any pair of nodes. This problem typically models network design applications where all vertices must communicate with each other at a
An InverseAckermann Type Lower Bound for Online Minimum Spanning Tree Verification
 Combinatorica
"... Given a spanning tree T of some graph G, the problem of minimum spanning tree verication is to decide whether T = MST(G). A celebrated result of Komlos shows that this problem can be solved in linear time. Somewhat unexpectedly, MST verication turns out to be useful in actually computing minimum spa ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Given a spanning tree T of some graph G, the problem of minimum spanning tree verication is to decide whether T = MST(G). A celebrated result of Komlos shows that this problem can be solved in linear time. Somewhat unexpectedly, MST verication turns out to be useful in actually computing minimum
Variable neighborhood search for the bounded diameter minimum spanning tree problem
 Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search
, 2005
"... The bounded diameter minimum spanning tree problem is an NPhard combinatorial optimization problem with applications in various fields like communication network design. We propose a general variable neighborhood search approach for it, utilizing four different types of neighborhoods. They were d ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
The bounded diameter minimum spanning tree problem is an NPhard combinatorial optimization problem with applications in various fields like communication network design. We propose a general variable neighborhood search approach for it, utilizing four different types of neighborhoods. They were
Overlay Mesh Construction Using Interleaved Spanning Trees
 in Proc. of INFOCOM
, 2004
"... In this paper we evaluate a method of using interleaved spanning trees to compose a resilient, high performance overlay mesh. Though spanning trees of arbitrary type could be used to construct an overlay mesh, we focus on a distributed algorithm that computes k minimum spanning trees on an arbitrary ..."
Abstract

Cited by 50 (1 self)
 Add to MetaCart
In this paper we evaluate a method of using interleaved spanning trees to compose a resilient, high performance overlay mesh. Though spanning trees of arbitrary type could be used to construct an overlay mesh, we focus on a distributed algorithm that computes k minimum spanning trees
Variations for spanning trees
, 2006
"... Coursebooks discussing graph algorithms usually have a chapter on minimum spanning trees. It usually contains Prim’s and Kruskal’s algorithms [1, 2] but often lacks other applications. This type of problem is rarely present at informatics competitions or in tests in secondary or higher level inform ..."
Abstract
 Add to MetaCart
Coursebooks discussing graph algorithms usually have a chapter on minimum spanning trees. It usually contains Prim’s and Kruskal’s algorithms [1, 2] but often lacks other applications. This type of problem is rarely present at informatics competitions or in tests in secondary or higher level
An Evolutionary Approach to the MultiLevel Capacitated Minimum Spanning Tree Problem
"... this paper we deal with a variant of the CMST problem that we believe reflects the practical concerns that arise in the design of local access networks more closely. In our problem we allow for the installation of multiple types of facilities with differing capacities. This problem we call the Multi ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
the MultiLevel Capacitated Minimum Spanning Tree Problem (MLCMST)
Todays lecture Trees and forests Optimal forests Minimum spanning forests Shortest path forests Applications in image segmentation Part 1: Forests and trees
"... In this lecture, we will consider two special types of graphs: forests and trees. A forest is a graph without simple cycles. A tree is a connected forest (In other words, a forest is a collection of trees) Recall: Cycles, connected graphs A cycle is a path where the start vertex is the same as the e ..."
Abstract
 Add to MetaCart
represents the dissimilarity (or, alternatively, similarity) between the vertices connected by the edge. For example, we may define the edge weights as w(eij) = I (v) − I (j)  , (1) where I (v) is the intensity of the image element corresponding to v. Part 2: Minimum spanning trees Minimum spanning trees
Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search
 In Proceedings of the 18th MiniEuro Conference on Variable Neighborhood Search
, 2005
"... In the generalized version of the classical Minimum Spanning Tree problem, the nodes of a graph are partitioned into clusters and exactly one node from each cluster must be connected. This problem plays, for example, a role in the design of backbones in larger communication networks. We present a Va ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In the generalized version of the classical Minimum Spanning Tree problem, the nodes of a graph are partitioned into clusters and exactly one node from each cluster must be connected. This problem plays, for example, a role in the design of backbones in larger communication networks. We present a
Results 1  10
of
143