2000 character limit reached
A rigorous analysis of the cavity equations for the minimum spanning tree
Published 12 Jan 2009 in cond-mat.stat-mech, cond-mat.dis-nn, and cs.DS | (0901.1684v1)
Abstract: We analyze a new general representation for the Minimum Weight Steiner Tree (MST) problem which translates the topological connectivity constraint into a set of local conditions which can be analyzed by the so called cavity equations 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
