A LEARNING AUTOMATA-BASED ALGORITHM TO THE STOCHASTIC MIN-DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM

DOI10.1142/S012905411350007XzbMath1286.68296OpenAlexW1972373016MaRDI QIDQ2856008

Javad Akbari Torkestani

Publication date: 23 October 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905411350007x

zbMATH Keywords

learning automataminimum spanning treemin-degree constrained minimum spanning tree problemstochastic graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational learning theory (68Q32) Random graphs (graph-theoretic aspects) (05C80) Formal languages and automata (68Q45) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On type-2 fuzzy weighted minimum spanning tree

Cites Work

• Variable neighborhood search
• Learning Optimal Discriminant Functions through a Cooperative Game of Automata
• A New Class of Algorithms for Multipoint Network Optimization

This page was built for publication: A LEARNING AUTOMATA-BASED ALGORITHM TO THE STOCHASTIC MIN-DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM