Geographic Decomposition of the Shortest Path Problem, with an Application to the Traffic Assignment Problem

1982 ◽  
Vol 28 (12) ◽  
pp. 1380-1390 ◽  
Author(s):  
Zachary F. Lansdowne ◽  
David W. Robinson
Keyword(s):  
Shortest Path ◽  
Assignment Problem ◽  
Traffic Assignment ◽  
Shortest Path Problem ◽  
Traffic Assignment Problem

scholarly journals Random assignment and shortest path problems

2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Johan Wästlund
Keyword(s):  
Limit Theorem ◽  
Shortest Path ◽  
Complete Graph ◽  
Assignment Problem ◽  
Shortest Path Problem ◽  
Random Assignment ◽  
Shortest Path Problems ◽  
Parisi Formula ◽  
International Audience ◽  
Random Assignment Problem

International audience 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.

Sign in / Sign up

Export Citation Format

Share Document