Coppersmith–Sorkin conjecture for expected k-assignment cost
Statement
Let denote the expected cost of an optimal -assignment in an matrix of independent exponentially distributed random variables with mean . Here a -assignment is a set of entries with no two in the same row or column. Coppersmith–Sorkin conjecture.
The source says this conjecture was verified for for arbitrary and , but gives no general 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.