Limit Laws for the Optimal Directed Tree with Random Costs

Combinatorics Probability and Computing

Volumn 6, Issue 3, 1997, Pages 315-335

  Hansen, Jennie C ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031515486     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003052     Document Type: Article

References (10)

1. Arnold, B. C., Balakrishan, N. and Nagaraja, H. N. (1992) A First Course in Order Statistics. Wiley.
2. Arratia, R., Stark, D. and Tavaré, S. (1995) Total variation asymptotics for Poisson process approximations of logarithmic combinatorial assemblies. Ann. of Probab. 23 1347-1388.
3. Bollobás, B. (1985) Random Graphs. Academic Press.
4. Chung, K. L. (1974) A Course in Probability Theorey, 2nd Ed. Academic Press.
5. Feller, W. (1971) An Introduction to Probability Theory and Its Applications, Vol. 2. Wiley.
6. Flajolet, P. and Soria, M. (1993) General combinatorial schemas: Gaussian limit distributions and exponential tails. Discrete Math. 114 159-180.
7. Hansen, J. C. (1994) Order statstics for decomposable combinatorial structures. Rand. Structures and Algorithms 5 517-533.
8. Karp, R. M. and Steele, J. M. (1985) Probabalistic analysis of heuristics. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (editors), The Travelling Salesman Problem, pp. 181-205. Wiley.
9. McDiarmid, C. J. M. (1986) On the greedy algorithm with random costs. Math. Program. 36 245-255.
10. Ross, S. M. (1981) A random graph. J. Appl. Probab. 18 309-315.