Learning automata-based algorithms for solving stochastic minimum spanning tree problem

Applied Soft Computing Journal

Volumn 11, Issue 6, 2011, Pages 4064-4077

  Akbari Torkestani, Javad ^a   Meybodi, Mohammad Reza ^b,c  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^c INSTITUTE FOR STUDIES IN THEORETICAL PHYSICS AND MATHEMATICS IPM   (Iran)

Author keywords

Learning automata; Minimum spanning tree; Stochastic graph

Indexed keywords

CONVERGENCE RATES; CONVERGENCE SPEED; EDGE SENSITIVITY; EDGE WEIGHTS; GRAPH EDGES; LEARNING AUTOMATA; LEARNING RATES; MINIMUM SPANNING TREE PROBLEM; MINIMUM SPANNING TREES; NUMERICAL RESULTS; PROBABILISTIC DISTRIBUTION; PROPER LEARNING; RUNNING TIME; SAMPLING ALGORITHM; SAMPLING METHOD; SAMPLING PROCESS; SAMPLING RATES; SIMULATION EXPERIMENTS; SPANNING TREE; STANDARD SAMPLING METHODS; STOCHASTIC ENVIRONMENT; STOCHASTIC GRAPH; STOCHASTIC GRAPHS; TRADE OFF;

AUTOMATA THEORY; DISTRIBUTION FUNCTIONS; EFFICIENCY; LEARNING ALGORITHMS; PARALLEL ARCHITECTURES; PLANT EXTRACTS; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; SAMPLING; STOCHASTIC SYSTEMS; TREES (MATHEMATICS);

CONVERGENCE OF NUMERICAL METHODS;

EID: 79956157430     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2011.02.017     Document Type: Article

References (54)

1. O. Boruvka O jistem Problemu Minimalnim (about a certain minimal problem) Praca Moravske Prirodovedecke Spolecnosti 3 1926 37 58
2. J.B. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society 7 1956 48 50
3. R.C. Prim Shortest connection networks and some generalizations Bell System Technical Journal 36 1957 1389 1401
4. H. Ishii, S. Shiode, T. Nishida, and Y. Namasuya Stochastic spanning tree problem Discrete Applied Mathematics 3 1981 263 273
5. H. lshii, and T. Nishida Stochastic bottleneck spanning tree problem Networks 13 1983 443 449 (Pubitemid 13607239)
6. I.B. Mohd Interval elimination method for stochastic spanning tree problem Applied Mathematics and Computation 66 1994 325 341
7. H. Ishii, and T. Matsutomi Confidence regional method of stochastic spanning tree problem Mathematical and Computer Modelling 22 19-12 1995 77 82
8. C. Alexopoulos, and J.A. Jacobson State space partition algorithms for stochastic systems with applications to minimum spanning trees Networks 35 2 2000 118 138
9. K. Dhamdhere, R. Ravi, and M. Singh On Two-Stage Stochastic Minimum Spanning Trees 2005 Springer-Verlag Berlin pp. 321-334
10. C. Swamy, and D.B. Shmoys Algorithms column: approximation algorithms for 2-stage stochastic optimization problems ACM SIGACT News 37 1 2006 1 16
11. M.A.L. Thathachar, and B.R. Harita Learning automata with changing number of actions IEEE Transactions on Systems, Man, and Cybernetics SMG17 1987 1095 1100 (Pubitemid 18568122)
12. K.S. Narendra, and K.S. Thathachar Learning Automata: An Introduction 1989 Printice-Hall New York
13. S. Lakshmivarahan, and M.A.L. Thathachar Bounds on the convergence probabilities of learning automata IEEE Transactions on Systems, Man, and Cybernetics SMC-6 1976 756 763
14. J. Zhou, E. Billard, and S. Lakshmivarahan Learning in multilevel games with incomplete information - part II IEEE Transactions on System, Man, and Cybernetics 29 3 1999 340 349
15. M.A.L. Thathachar, and P.S. Sastry A hierarchical system of learning automata that can learn the globally optimal path Information Science 42 1997 743 766
16. M.A.L. Thathachar, and V.V. Phansalkar Convergence of teams and hierarchies of learning automata in connectionist systems IEEE Transactions on Systems, Man, and Cybernetics 24 1995 1459 1469
17. S. Lakshmivarahan, and K.S. Narendra Learning algorithms for two person zero-sum stochastic games with incomplete information: a unified approach SIAM Journal on Control and Optimization 20 1982 541 552 (Pubitemid 12550201)
18. K.S. Narenrdra, and M.A.L. Thathachar On the behavior of a learning automaton in a changing environment with application to telephone traffic routing IEEE Transactions on Systems, Man, and Cybernetics SMC-l0 5 1980 262 269
19. H. Beigy, and M.R. Meybodi Utilizing distributed learning automata to solve stochastic shortest path problems International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 14 2006 591 615 (Pubitemid 44569902)
20. R.G. Gallager, P.A. Humblet, and P.M. Spira A distributed algorithm for minimum weight spanning trees ACM Transactions on Programming Language and Systems 5 1983 66 77
21. F. Chin, and H.F. Ting An almost linear time and O(n log n + e) messages distributed algorithm for minimum-weight spanning trees Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (FOCS) 1985 257 266 (Pubitemid 16541422)
22. E. Gafni Improvements in the Time Complexity of Two Message-Optimal Election Algorithms Proceedings s of the 4th Symposium on Principles of Distributed Computing (PODC) 1985 175 185
23. B. Awerbuch Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems Proceedings of the 19th ACM Symposium on Theory of Computing (STOC) 1987 230 240 (Pubitemid 18643410)
24. J Garay, S. Kutten, and D. Peleg A sublinear time distributed algorithm for minimum-weight spanning trees SIAM Journal of Computing 27 1998 302 316 (Pubitemid 128596830)
25. M. Elkin Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem Proceedings of the ACM Symposium on Theory of Computing (STOC) 2004 331 340
26. M. Elkin An overview of distributed approximation ACM SIGACT News Distributed Computing Column 35 4 2004 40 57
27. M. Khan, and G. Pandurangan A fast distributed approximation algorithm for minimum spanning trees Proceedings of the 20th International Symposium on Distributed Computing (DISC) September 2006
28. F.B. Alt Bonferroni inequalities and intervals Encyclopedia of Statistical Sciences 1 1982 294 301
29. C.E. Bonferroni Teoria Statistica Delle Classi e Calcolo Delle Probabilit'a Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commerciali di Firenze 8 1936 3 62
30. S. Holm A simple sequentially rejective multiple test procedure Scandinavian Journal of Statistics 6 1979 65 70
31. S. Marchand-Maillet, and Y.M. Sharaiha A minimum spanning tree approach to line image analysis Proceedings of 13th International Conference on Pattern Recognition (ICPR'96) 1996 225
32. J. Li, S. Yang, X. Wang, X. Xue, and B. Li Tree-structured data regeneration with network coding in distributed storage systems Proceedings of International Conference on Image Processing Charleston, USA 2009 481 484
33. J.C. Gower, and G.J.S. Ross Minimum spanning trees and single linkage cluster analysis Journal of the Royal Statistical Society (Applied Statistics) 18 1 1969 54 64
34. Z. Barzily, Z. Volkovich, B. Akteke-Öztürk, and G.W. Weber On a minimal spanning tree approach in the cluster validation problem Informatica 20 2 2009 187 202
35. R.E. Osteen, and P.P. Lin Picture skeletons based on eccentricities of points of minimum spanning trees SIAM Journal on Computing 3 1974 23 40
36. T.C. Chiang, C.H. Liu, and Y.M. Huang A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm Expert Systems with Applications 33 2007 734 742
37. G. Rodolakis, A. Laouiti, P. Jacquet, and A.M. Naimi Multicast overlay spanning trees in ad hoc networks: capacity bounds protocol design and performance evaluation Computer Communications 31 2008 1400 1412
38. H. Katagiri, E.B. Mermri, M. Sakawa, and K. Kato A study on fuzzy random minimum spanning tree problems through possibilistic programming and the expectation optimization model Proceedings of the 47th IEEE International Midwest Symposium on Circuits and Systems 2004
39. H. Fangguo, and Q. Huan A model and algorithm for minimum spanning tree problems in uncertain networks Proceedings of the 3rd International Conference on Innovative Computing Information and Control (ICICIC'08) 2008
40. T.A. Almeida, A. Yamakami, and M.T. Takahashi An evolutionary approach to solve minimum spanning tree problem with fuzzy parameters Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation 2005
41. K.R. Hutson, and D.R. Shier Minimum spanning trees in networks with varying edge weights Annals of Operations Research 146 2006 3 18 (Pubitemid 44290700)
42. K.R. Hutson, and D.R. Shier Bounding distributions for the weight of a minimum spanning tree in stochastic networks Operations Research 53 5 2005 879 886 (Pubitemid 41525856)
43. J. Akbari Torkestani, and M.R. Meybodi A learning automata-based cognitive radio for clustered wireless ad-hoc networks Journal of Network and Systems Management 19 2 2011 278 297
44. J. Akbari Torkestani, M.R. Meybodi, A Learning automata-based Heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs, Journal of Supercomputing, Springer Publishing Company, in press, doi:10.1007/s11227-010-0484-1.
45. J. Akbari Torkestani, and M.R. Meybodi Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs, International Journal of Uncertainty, Fuzziness and Knowledge-based Systems 18 6 2010 721 758
46. J. Akbari Torkestani, and M.R. Meybodi Mobility-based multicast routing algorithm in wireless mobile ad hoc networks: a learning automata approach Journal of Computer Communications 33 2010 721 735
47. J. Akbari Torkestani, and M.R. Meybodi A new vertex coloring algorithm based on variable action-set learning automata Journal of Computing and Informatics 29 3 2010 1001 1020
48. J. Akbari Torkestani, M.R. Meybodi, Weighted Steiner connected dominating set and its application to multicast routing in wireless MANETs, Wireless Personal Communications, Springer Publishing Company, in press, doi:10.1007/s11277-010-9936-4.
49. J. Akbari Torkestani, and M.R. Meybodi An efficient cluster-based CDMA/TDMA scheme for wireless mobile AD-Hoc networks: a learning automata approach Journal of Network and Computer Applications 33 2010 477 490
50. J. Akbari Torkestani, and M.R. Meybodi Clustering the wireless ad-hoc networks: a distributed learning automata approach Journal of Parallel and Distributed Computing 70 2010 394 405
51. J. Akbari Torkestani, and M.R. Meybodi An intelligent backbone formation algorithm in wireless ad hoc networks based on distributed learning automata Journal of Computer Networks 54 2010 826 843
52. J. Akbari Torkestani, M.R. Meybodi, A mobility-based cluster formation algorithm for wireless mobile ad hoc networks, Journal of Cluster Computing, Springer Publishing Company, in press, doi:10.1007/s10586-011-0161-z.
53. J. Akbari Torkestani, and M.R. Meybodi A Cellular Learning Automata-based Algorithm for Solving the Vertex Coloring Problem Journal of Expert Systems with Applications 38 2011 9237 9247
54. J. Akbari Torkestani, M.R. Meybodi, A link stability-based multicast routing protocol for wireless mobile ad hoc networks, Journal of Network and Computer Applications, in press, doi:10.1016/j.jnca.2011.03.026.