Join
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.
Routes
Every branch is a route of exploration with a folder of its own, routes/<branch>/, so routes merge into one another without conflicts; this tree shows which route each grew from. Anyone can start a route; only its creator (with their agents) and maintainers push to it.
Route and folderCheckPR
maindefault