A new algorithm for degree-constrained minimum spanning tree based on the reduction technique
TLDR
Novel mathematical properties for DCMST are indicated which lead to a new reduction algorithm that can significantly reduce the size of the problem.Abstract:
The degree-constrained minimum spanning tree (DCMST) is an NP-hard problem in graph theory. It consists of finding a spanning tree whose vertices should not exceed some given maximum degrees and whose total edge length is minimal. In this paper, novel mathematical properties for DCMST are indicated which lead to a new reduction algorithm that can significantly reduce the size of the problem. Also an algorithm for DCMST to solve the smaller problem is presented which has been preprocessed by reduction algorithm.read more
Citations
More filters
Journal ArticleDOI
Degree constrained minimum spanning tree problem: a learning automata approach
TL;DR: A decentralized learning automata-based heuristic called LACT for approximating the DCMST problem is proposed and it is observed that the proposed algorithm significantly outperforms the existing method.
Journal ArticleDOI
Contact Plan Design for GNSS Constellations: A Case Study With Optical Intersatellite Links
TL;DR: In this article , the authors present a contact plan design scheme based on a degree constrained minimum spanning tree heuristic applied to such OISL-enabled Global Navigation Satellite System (O-GNSS) constellations.
Journal ArticleDOI
Cellular Competitive Decision Algorithm for Minimum Ratio Spanning Tree
Xiao Hua Xiong,Ai Bing Ning +1 more
TL;DR: A cellular competitive decision algorithm for MRST is presented and to verify the efficiency of the algorithm, it is been coded in Delphi 7, by which series of instances are tested and results result in good performance.
SEFSD: an effective deployment algorithm for fog computing systems
TL;DR: An effective fog device deployment algorithm based on a new metaheuristic algorithm–search economics–to solve the optimization problem for the deployment of fog computing systems is proposed.
Book ChapterDOI
A Bio-Inspired-Based Degree Constrained MST Algorithm for Cognitive Radio Networks
TL;DR: In this article, the authors used the genetic algorithm along with ant colony optimization to solve the problem of constructing minimum spanning tree (MST) in cognitive radio networks (CRN).
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Computer solutions of the traveling salesman problem
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Journal ArticleDOI
On the History of the Minimum Spanning Tree Problem
Ron Graham,Pavol Hell +1 more
TL;DR: There are several apparently independent sources and algorithmic solutions of the minimum spanning tree problem and their motivations, and they have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century.
Journal ArticleDOI
Degree-constrained minimum spanning tree
Subhash C. Narula,Cesar A. Ho +1 more
TL;DR: A primal and a dual heuristic procedure and a branch-and-bound algorithm are proposed to construct a DCMST, which is formulated as a linear 0–1 integer programming problem.