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....
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Discrete Mathematics & Theoretical Computer Science
2006-01-01
|
| Schriftenreihe: | Discrete Mathematics & Theoretical Computer Science |
| Schlagworte: | |
| Online-Zugang: | https://dmtcs.episciences.org/3504/pdf |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|