Random assignment and shortest path problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2006

Random assignment and shortest path problems


We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We give direct proofs of the analogs for the shortest path problem of some results established by D. Aldous in connection with his $\zeta (2)$ limit theorem for the assignment problem.
Fichier principal
Vignette du fichier
dmAG0102.pdf (174.88 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184708 , version 1 (17-08-2015)



Johan Wästlund. Random assignment and shortest path problems. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.31-38, ⟨10.46298/dmtcs.3504⟩. ⟨hal-01184708⟩


45 View
430 Download



Gmail Facebook Twitter LinkedIn More