For random combinatorial optimization problems such as minimum spanning arborescences, non-bipartite perfect matchings, and symmetric or asymmetric traveling-salesman problems…
Statement
For random combinatorial optimization problems such as minimum spanning arborescences, non-bipartite perfect matchings, and symmetric or asymmetric traveling-salesman problems with i.i.d. uniform or exponential edge weights, is the expected Vickrey cost asymptotic to twice the expected minimum cost?
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.