Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.

Ludek Kucera Alberto Marchetti-Spaccamela Marco Protasi Maurizio Talamo

Published in: MFCS (1986)

Keyphrases

random graphs
computational complexity
minimum spanning tree
reinforcement learning
worst case
graphical models
graph theory
graph theoretic