加入
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.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
没有开放的 PR
PR 把工作从一个分支带到另一个分支。
新建 PR