STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations
SIAM Journal on Computing
Learning automata with changing number of actions
IEEE Transactions on Systems, Man and Cybernetics
Learning automata: an introduction
Learning automata: an introduction
Interval elimination method for stochastic spanning tree problem
Applied Mathematics and Computation
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
SIAM Journal on Computing
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree
Journal of Heuristics
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The Delay-Constrained Minimum Spanning Tree Problem
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Learning automata and its application to priority assignment in a queueing system with unknown characteristics
A faster distributed protocol for constructing a minimum spanning tree
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Distributed approximation: a survey
ACM SIGACT News
An Evolutionary Approach to Solve Minimum Spanning Tree Problem with Fuzzy Parameters
CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-2 (CIMCA-IAWTIC'06) - Volume 02
An ant-based algorithm for finding degree-constrained minimum spanning tree
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A Minimum Spanning Tree Approach to Line Image Analysis
ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2
A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm
Expert Systems with Applications: An International Journal
Design of capacitated minimum spanning tree with uncertain cost and demand parameters
Information Sciences: an International Journal
Storage Reduction Through Minimal Spanning Trees and Spanning Forests
IEEE Transactions on Computers
On the History of the Minimum Spanning Tree Problem
IEEE Annals of the History of Computing
A Model and Algorithm for Minimum Spanning Tree Problems in Uncertain Networks
ICICIC '08 Proceedings of the 2008 3rd International Conference on Innovative Computing Information and Control
Clustering the wireless Ad Hoc networks: A distributed learning automata approach
Journal of Parallel and Distributed Computing
Clustering the wireless Ad Hoc networks: A distributed learning automata approach
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Network and Computer Applications
A Learning Automata-Based Cognitive Radio for Clustered Wireless Ad-Hoc Networks
Journal of Network and Systems Management
Mathematical Programming: Series A and B
Wireless Personal Communications: An International Journal
On two-stage stochastic minimum spanning trees
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A fast distributed approximation algorithm for minimum spanning trees
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Learning in multilevel games with incomplete information. I
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Multiple stochastic learning automata for vehicle path control in an automated highway system
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Confidence regional method of stochastic spanning tree problem
Mathematical and Computer Modelling: An International Journal
A Learning Automata-Based Cognitive Radio for Clustered Wireless Ad-Hoc Networks
Journal of Network and Systems Management
A cellular learning automata-based algorithm for solving the vertex coloring problem
Expert Systems with Applications: An International Journal
Learning automata-based algorithms for solving stochastic minimum spanning tree problem
Applied Soft Computing
A link stability-based multicast routing protocol for wireless mobile ad hoc networks
Journal of Network and Computer Applications
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks
Computers and Electrical Engineering
Learning automata-based algorithms for finding cover sets in wireless sensor networks
The Journal of Supercomputing
Hi-index | 0.00 |
During the last decades, a host of efficient algorithms have been developed for solving the minimum spanning tree problem in deterministic graphs, where the weight associated with the graph edges is assumed to be fixed. Though it is clear that the edge weight varies with time in realistic applications and such an assumption is wrong, finding the minimum spanning tree of a stochastic graph has not received the attention it merits. This is due to the fact that the minimum spanning tree problem becomes incredibly hard to solve when the edge weight is assumed to be a random variable. This becomes more difficult if we assume that the probability distribution function of the edge weight is unknown. In this paper, we propose a learning automata-based heuristic algorithm to solve the minimum spanning tree problem in stochastic graphs wherein the probability distribution function of the edge weight is unknown. The proposed algorithm taking advantage of learning automata determines the edges that must be sampled at each stage. As the presented algorithm proceeds, the sampling process is concentrated on the edges that constitute the spanning tree with the minimum expected weight. The proposed learning automata-based sampling method decreases the number of samples that need to be taken from the graph by reducing the rate of unnecessary samples. Experimental results show the superiority of the proposed algorithm over the well-known existing methods both in terms of the number of samples and the running time of algorithm.