Stochastic Bounded Diameter Minimum Spanning Tree Problem

DOI10.3233/FI-2015-1250zbMATH Open1348.68088OpenAlexW1895221447MaRDI QIDQ3187006FDOQ3187006

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

samplinglearning automatastochastic graphbounded diameter minimum spanning tree problem

Mathematics Subject Classification ID

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

Cited In (10)

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

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)