The random linear bottleneck assignment problem

RAIRO Recherche Operationnelle

Volumn 30, Issue 2, 1996, Pages 127-142

  Pferschy, U ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Average case analysis; Random bottleneck assignment; Random graphs

Indexed keywords

ALLOCATION; BOTTLENECK; LINEAR GRAPH;

GRAPH THEORY;

EID: 0030374137     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro/1996300201271     Document Type: Article

References (18)

1. M. ABRAMOWITZ and I. A. STEGUN, Handbook of Mathematical functions, Dover Publications, New York, 1965.
2. B. BOLLOBÁS, Random Graphs, Academic Press, 1985.
3. B. BOLLOBÁS and A. THOMASON, Random graphs of small order, Random Graphs'83, Annals of Discrete Math., 1985, 28, pp. 47-97.
4. R. E. BURKARD and U. DERIGS, Assignment and Matching Problems: Solution Methods with FORTRAN-Programs, Springer Lecture Notes in Economics and Mathematical Systems, 1980, 184.
5. U. DERIGS, The shortest augmenting path method for solving assignment problems, Annals of Operations Research, 1985, 4, pp. 57-102.
6. U. DERIGS, Programming in networks and graphs, Springer Lectures Notes in Economics and Mathematical Systems, 1988, 300.
7. P. ERDOS and A. RÉNYI, On random matrices, Publ. Math. Inst. Hungar. Acad. Sci., 1964, 8, pp. 455-461.
8. J. B. G. FRENK, M. VAN HOUWENINGE and A. H. G. RINNOOY KAN, Order statistics and the linear assignment problem, Report 8609/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands, 1986.
9. H. N. GABOW and R. E. TARJAN, Algorithms for two bottleneck optimization problems, J. of Algorithms, 1988, 9, pp. 411-417.
10. 3/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 1973, 2, pp. 225-231.
11. R. M. KARP, An algorithm to solve the m x n assignment problem in expected time O (mn log n), Networks, 1980, 10, pp. 143-152.
12. R. M. KARP, An upper bound on the expected cost of an optimal assignment, Technical report, Computer Sc. Div., Univ. of California, Berkeley, 1984.
13. S. LANG, Complex Analysis, Springer, 1985.
14. A. J. LAZARUS, The assignment problem with uniform (0, 1) cost matrix. Master's thesis, Department of Mathematics, Princeton University, 1979.
15. B. OLIN, Asymptotic properties of random assignment problems. PhD-thesis, Division of Optimization and Systems Theory, Department of Mathematics, Royal Institute of Technology, Stockholm, 1992.
16. E. M. PALMER, Graphical Evolution, J. Wiley & Sons, 1985.
17. D. W. WALKUP, On the expected value of a random assignment problem, SIAM J. Comput., 1979, 8, pp. 440-442.
18. D. W. WALKUP, Matchings in random regular bipartite digraphs, Discrete Mathematics, 1980, 31, pp. 59-64.