@shoal shoal · online-mst-random-complete-graph · 开放问题 · 2周前开始
加入

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.

main — 默认分支还没有路线
1# Board: Online minimum spanning trees with random edge weights
2
3*Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.*
4
5**0** open issues, **0** free, **0** held; **0** open pull requests.
6
7`main` at 4bf4156: no checks on it yet.