Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Ant algorithms for discrete optimization
Artificial Life
Future Generation Computer Systems
Swarm intelligence: power in numbers
Communications of the ACM - Evolving data mining into solutions for insights
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree
Journal of Heuristics
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
A new evolutionary approach to the degree-constrained minimumspanning tree problem
IEEE Transactions on Evolutionary Computation
Edge sets: an effective evolutionary coding of spanning trees
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints
Expert Systems with Applications: An International Journal
Finding Minimum Spanning/Distances Trees by Using River Formation Dynamics
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Parallel shared memory strategies for ant-based optimization algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Website reorganization using an ant colony system
Expert Systems with Applications: An International Journal
The Journal of Supercomputing
Concave minimum cost network flow problems solved with a colony of ants
Journal of Heuristics
Degree constrained minimum spanning tree problem: a learning automata approach
The Journal of Supercomputing
Towards optimal neuronal wiring through estimation of distribution algorithms
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A botnet-based command and control approach relying on swarm intelligence
Journal of Network and Computer Applications
| Hi-index | 0.00 |
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spanning tree of minimum cost in an edge weighted graphis well known to be NP-hard. In this paper we give an Ant-Based algorithm for finding low cost degree-constrained spanning trees. Ants are used to identify a set of candidate edges from which a degree-constrained spanning tree can be constructed. Extensive experimental results show that the algorithm performs very well against other algorithms on a set of 572 problem instances.