Results 321 to 330 of about 248,790 (377)
The constrained minimum spanning tree problem [PDF]
, 1996 Given an undirected graph with two different nonnegative costs associated with every edge e (say, we for the weight and l e for the length of edge e) and a budget L, consider the problem of finding a spanning tree of total edge length at most L and minimum total weight under this restriction.
Michel X. Goemans, R. Ravi
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2010
In this chapter, we study the behavior of stochastic search algorithms on an important graph problem. We consider the well-known problem of computing a minimum spanning tree in a given undirected connected graph with n vertices and m edges. The problem has many applications in the area of network design.
Frank Neumann, Carsten Witt
openaire +2 more sources
In this chapter, we study the behavior of stochastic search algorithms on an important graph problem. We consider the well-known problem of computing a minimum spanning tree in a given undirected connected graph with n vertices and m edges. The problem has many applications in the area of network design.
Frank Neumann, Carsten Witt
openaire +2 more sources
An Extended Minimum Spanning Tree method for characterizing local urban patterns
International Journal of Geographical Information Science, 2018Detailed and precise information on urban building patterns is essential for urban design, landscape evaluation, social analyses and urban environmental studies.
Bin Wu +6 more
semanticscholar +1 more source
, 2004 Suppose you have a business with several branch offices and you want to lease phone lines to connect them with each other. Your goal is to connect all your offices with the minimum total cost. The resulting connection should be a spanning tree since if it is not a tree, you can always remove some edges without losing the connectivity to save money.
openaire +1 more source
, 1999 The case studies usually found in the B literature present many of the characteristics common to safety-critical software systems. The successful use of B on such systems, as exemplified by several realistic large-size projects [21, 40], has greatly contributed to increasing the interest of industrial practitioners in formal development techniques.
openaire +1 more source
On Steiner trees and minimum spanning trees in hypergraphs
Operations Research Letters, 2003The bottleneck of the state-of-the-art algorithms for geometric Steiner problems is usually the concatenation phase, where the prevailing approach treats the generated full Steiner trees as edges of a hypergraph and uses an LP-relaxation of the minimum spanning tree in hypergraph (MSTH) problem.
Daneshmand, Siavash Vahdati +1 more
openaire +3 more sources
Finding Minimum Spanning Trees
SIAM Journal on Computing, 1976This paper studies methods for finding minimum spanning trees in graphs. Results include 1. several algorithms with $O(m\log \log n)$ worst-case running times, where n is the number vertices and m is the number of edges in the problem graph; 2. an $O(m)$ worst-case algorithm for dense graphs (those for which m is $\Omega (n^{1 + \varepsilon } )$ for ...
Robert E. Tarjan, David R. Cheriton
openaire +1 more source
Reoptimization of the minimum spanning tree
WIREs Computational Statistics, 2011AbstractWe implement a fast reoptimization algorithm for MIN SPANNING TREE under vertex insertions, initially proposed and analyzed in the work of Boria and Paschos [Boria N, Paschos VTh. Fast reoptimization for the minimum spanning tree problem. J Discrete Algor 2010, 8:296–310] and study its experimental approximation behavior in randomly generated ...
Paschos, Stratos, Paschos, Vangelis
openaire +2 more sources
Expert systems with applications, 2022
Amna Habib, M. Akram, C. Kahraman
semanticscholar +1 more source
Amna Habib, M. Akram, C. Kahraman
semanticscholar +1 more source
2013
A minimum spanning tree of a weighted graph is its spanning tree T with a minimum total cost of edges in T of all possible spanning trees. Minimum spanning trees have many applications in computer networks. In this chapter, we investigate synchronous and asynchronous distributed algorithms to construct minimum spanning trees.
openaire +2 more sources
A minimum spanning tree of a weighted graph is its spanning tree T with a minimum total cost of edges in T of all possible spanning trees. Minimum spanning trees have many applications in computer networks. In this chapter, we investigate synchronous and asynchronous distributed algorithms to construct minimum spanning trees.
openaire +2 more sources