Results 261 to 270 of about 133,936 (292)

Min‐degree constrained minimum spanning tree problem: complexity, properties, and formulations

International Transactions in Operational Research, 2011
AbstractThis paper addresses a new combinatorial problem, the Min‐Degree Constrained Minimum Spanning Tree (md‐MST), that can be stated as: given a weighted undirected graph with positive costs on the edges and a node‐degrees function , the md‐MST is to find a minimum cost spanning tree T of G, where each node i of T either has at least a degree of ...
de Almeida, Ana Maria, Martins, Pedro, de Souza, Maurício C.   +2 more
openaire   +1 more source

Bees algorithm for degree-constrained minimum spanning tree problem

2012 NATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION SYSTEMS, 2012
The problem of identifying a minimum spanning tree (MST) of a connected, undirected graph is a classical combinatorial optimization problem which can be solved efficiently in polynomial time by greedy heuristics. But, there are several practically relevant variants of MST problem that have been shown to be NP-complete.
openaire   +1 more source

Multi-objective Optimization for the Degree-Constrained Minimum Spanning Tree

2008 International Conference on Computer Science and Software Engineering, 2008
The multi-objective degree-constrained minimum spanning tree problem (MST) is an NP-hard problem. In this paper, a model of the problem is formulated and an improved genetic algorithm for the problem is proposed. We employ partheno-genetic operations to improve the efficiency of genetic algorithm, and design a niche count with adaptive niche radius to ...
Fangguo He, Huan Qi
openaire   +1 more source

Minimum Degree Spanning Trees on Bipartite Permutation Graphs

2011
The minimum degree spanning tree problem is a widely studied NP-hard variation of the minimum spanning tree problem, and a generalization of the Hamiltonian path problem. Most of the work done on the minimum degree spanning tree problem has been on approximation algorithms, and very little work has been done studying graph classes where this problem ...
openaire   +1 more source

An improved genetic algorithm for degree constrained minimum spanning trees

2016 Chinese Control and Decision Conference (CCDC), 2016
The Minimum Spanning Tree (MST) is of crucial importance for Communication Networks (CNs), which can solve problems of unconstrained CNs effectively. However, in practical CNs, the degree of the spanning tree is constrained. In such a case, the problem is very difficult, which has been proved to be NP-hard. In this paper, an improved genetic algorithm (
Kai Shi, Qingfeng Song, Sheng Lin, Guangping Xu, Zhanxu Cao   +4 more
openaire   +1 more source

On the Maximum Degree of Minimum Spanning Trees

1993
Motivated by practical VLSI applications, we study the maximum vertex degree in a minimum spanning tree (MST) under arbitrary LP metrics. We show that the maximum vertex degree in a maximum - degree LP MST equals the Hadwiger number of the corresponding unit ball. We then determine the maximum vertex degree in a minimum-degree LP MST; towards this end,
openaire   +1 more source

Degree-constrained minimum spanning tree problem of uncertain random network

Journal of Ambient Intelligence and Humanized Computing, 2017
A degree-constrained minimum spanning tree (DCMST) problem involving any network aims to find the least weighted spanning tree of that network, subject to constraints on node degrees. In this paper, we first define a DCMST problem in an uncertain random network, where some weights are uncertain variables and others are random variables.
Xin Gao, Lifen Jia, Samarjit Kar
openaire   +1 more source

A local search heuristic for bounded-degree minimum spanning trees

Engineering Optimization, 2008
The bounded-degree minimum spanning tree (BDMST) problem has many practical applications. Unlike the unbounded case, the BDMST problem is NP-hard, and many attempts have been made to devise good approximation methods, including evolutionary algorithms.
M. S. Zahrani, M. J. Loomes, J. A. Malcolm, A. A. Albrecht   +3 more
openaire   +1 more source

Solving Degree-constrained Minimum Spanning Tree with a New Algorithm

2007 International Conference on Management Science and Engineering, 2007
The minimum spanning tree (MST) of a graph defines the cheapest subset of edges that keeps the graph in one connected component which is a classic problem in operational research (OR) with important applications in network design. The degree-constrained minimum spanning tree (DCMST) is a special case of MST, which is also an important problem in ...
Ning Ai-bing, Ma Liang, Xiong Xiao-hua
openaire   +1 more source

Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem

2007
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0, 1]d and a degree constraint b ≥ 2. The aim is to find a minimum weight spanning tree in which each vertex has degree at most b. In this paper we analyze the probabilistic version of the problem and prove in affirmative the conjecture of Yukich stated
Anand Srivastav, Sören Werth
openaire   +1 more source