Random assignment and shortest path problems
暂无分享,去创建一个
[1] Giorgio Parisi,et al. Mean-Field Equations for the Matching and the Travelling Salesman Problems , 1986 .
[2] Piet Van Mieghem,et al. Size and Weight of Shortest Path Trees with Exponential Link Weights , 2006, Combinatorics, Probability and Computing.
[3] Svante Linusson,et al. A proof of Parisi’s conjecture on the random assignment problem , 2003, math/0303214.
[4] Don Coppersmith,et al. Constructive bounds and exact expectations for the random assignment problem , 1998, Random Struct. Algorithms.
[5] D. Coppersmith,et al. Constructive bounds and exact expectation for the random assignment problem , 1999 .
[6] David W. Walkup,et al. On the Expected Value of a Random Assignment Problem , 1979, SIAM J. Comput..
[7] G. Parisi. A Conjecture on random bipartite matching , 1998, cond-mat/9801176.
[8] M. Mézard,et al. Replicas and optimization , 1985 .
[9] B. Prabhakar,et al. Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures , 2005 .
[10] P. V. Mieghem,et al. The weight of the shortest path tree , 2007 .
[11] M. Mézard,et al. On the solution of the random link matching problems , 1987 .
[12] Sven Erick Alm,et al. Exact Expectations And Distributions For The Random Assignment Problem , 2002, Comb. Probab. Comput..
[13] Mayank Sharma,et al. Proofs of the Parisi and Coppersmith-Sorkin conjectures for the finite random assignment problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[14] Piet Van Mieghem,et al. The weight of the shortest path tree , 2007, Random Struct. Algorithms.
[15] Johan Wästlund. AN EASY PROOF OF THE ζ ( 2 ) LIMIT IN THE RANDOM ASSIGNMENT PROBLEM , 2006 .
[16] Svante Janson,et al. One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights , 1999, Combinatorics, Probability and Computing.