Abstract
In this contribution asymptotic properties of the linear bottleneck assignment problem LBAP are investigated. It is shown that the expected value of the optimal solution of an n × n LBAP with independently and identically distributed costs tends towards the infimum of the cost range as n tends to infinity. Furthermore, explicit upper and lower bounds for the uniform cost distribution are given as functions in n. Exploiting results from evolutionary random graph theory an algorithm with O(n 2) expected running time is presented.
This research was supported by the Spezialforschungsbereich F003 “Optimierung und Kontrolle”, Projektbereich Diskrete Optimierung.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abramowitz, I.A. Stegun, Handbook of Mathematical functions, Dover Publications, New York, 1965.
B. Bollobás, Random Graphs, Academic Press, 1985.
B. Bollobás, A. Thomason, Random graphs of small order. Random Graphs '83, Annals of Discrete Mathematics 28, 47–97, 1985.
U. Derigs, Alternate strategies for solving bottleneck assignment problems-analysis and computational results. Computing 33, 95–106, 1984.
J.B.G. Frenk, M. van Houweninge, A.H.G. Rinnooy Kan, Order statistics and the linear assignment problem. Report 8609/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands, 1986.
H.N. Gabow, R.E. Tarjan, Algorithms for two bottleneck optimization problems. J. of Algorithms 9, 411–417, 1988.
R.M. Karp, An algorithm to solve the m × n assignment problem in expected time O(mn log n). Networks 10, 143–152, 1980.
R.M. Karp, An upper bound on the expected cost of an optimal assignment. Technical report, Computer Science Division, Univ. of California, Berkeley, 1984.
A.J. Lazarus, The assignment problem with uniform (0, 1) cost matrix. Master's thesis, Department of Mathematics, Princeton University, 1979.
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.
E.M. Palmer, Graphical Evolution, Wiley, 1985.
D.W. Walkup, On the expected value of a random assignment problem. SIAM J. Computing 8, 440–442, 1979.
D.W. Walkup, Matchings in random regular bipartite digraphs. Discrete Mathematics 31, 59–64, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pferschy, U. (1995). The random linear bottleneck assignment problem. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_48
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive