1. M.E. Dyer, A.M. Frieze and C.J.H. McDiarmid, “On linear programs with random costs,”Mathematical Programming 35 (1986) 3–16.
2. P. Erdös and A. Rényi, “On the evolution of random graphs,”Publications of the Mathematical Institute of the Hungarian Academy of Science 5 (1960) 17–61.
3. A.M. Frieze, “On the value of a random minimum spanning tree problem,”Discrete Applied Mathematics 10 (1985) 47–56.
4. R.M. Karp, “An upper bound on the expected cost of an optimal assignment,” Computer Science Division, University of California, Berkeley, 1984.
5. R.M. Karp, J.K. Lenstra, C.J.H. McDiarmid and A.H.G. Rinnooy Kan, “Probabilistic analysis of combinatorial algorithms: An annotated bibliography,” in: M. O’hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Combinatorial Optimization: Annotated Bibliographies (John Wiley and Sons Ltd., Chichester, 1985).