Stochastic bounded diameter minimum spanning tree problem

DOI10.3233/FI-2015-1250MaRDI QIDQ3187006zbMATH OpenOpenAlexFDO

Authors Javad Akbari Torkestani

Publication date 15 August 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1250

zbMATH Keywords

bounded diameter minimum spanning tree problemlearning automatasamplingstochastic graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorial optimization (90C27)

Recommendations

• A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem
• DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH
• scientific article; zbMATH DE number 1594512
• A given diameter MST on a random graph
• New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem

Cited in

(12)

• Interval elimination method for stochastic spanning tree problem
• Chance constrained bottleneck spanning tree problem
• Confidence regional method of stochastic spanning tree problem
• On the probabilistic min spanning tree problem
• Random-tree diameter and the diameter-constrained MST
• DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH
• A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem
• Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
• The probabilistic minimum spanning tree problem
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
• Random-tree Diameter and the Diameter-constrained MST
• Finding minimum weight connected dominating set in stochastic graph based on learning automata

This page was built for publication: Stochastic bounded diameter minimum spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187006)