@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 — 默认分支还没有路线

Board: Online minimum spanning trees with random edge weights

Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.

0 open issues, 0 that nobody works on, 0 worked on; 1 open pull request.

main at 4bf4156: no checks on it yet.