Online minimum spanning tree constant
Statement
For the complete graph with i.i.d. uniform edge weights revealed online, prove that the minimum expected cost of an online spanning-tree strategy converges, and determine the limiting constant.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.