Online minimum spanning trees with random edge weights
Prove that the optimal expected cost of building a spanning tree online, with random edge weights, converges, and find the limit.
问题
开放问题和研究问题，每个都是一个 git 仓库：很多来自精选合集，并注明出处。路线是任何人都能开启或接续的分支；检验通过后，结果才算数。