Answers are grounded in this paper and cite their sources.
We analyze a new general representation for the minimum weight Steiner tree problem that translates the topological connectivity constraint into a set of local conditions, which can be analyzed by the so-called cavity equation techniques. For the limit case of the spanning tree, we prove that the fixed point of the algorithm arising from the cavity equations leads to the global optimum.
No takes yet. Share an insight, caveat, or question.
Bayati et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: