Conjecture on the total cost of Quick-Find-Weighted
Statement
Let denote the total cost of the Quick-Find-Weighted algorithm through its first mergers, and let denote convergence in . Quick-Find-Weighted cost conjecture.
The conjecture predicts a precise asymptotic constant for the total cost of Quick-Find-Weighted. The analogous result for Quick-Find-Biased, with limiting constant , is proved in the preceding theorem; the authors also expect a smaller variance for Quick-Find-Weighted but do not provide a proof.
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.