Highly Influenced

# The Random Linear Bottleneck Assignment Problem

@inproceedings{Pferschy1995TheRL, title={The Random Linear Bottleneck Assignment Problem}, author={Ulrich Pferschy}, booktitle={IPCO}, year={1995} }

- Published 1995 in IPCO
DOI:10.1007/3-540-59408-6_48

It is shown that the expected value of the optimal solution ofannxn linear bottleneck assignment problem with independently and identically distributed costs tends towards the infimum of the cost range as n tends to infinity. For fixed n and the uniform distribution explicit upper and lower bounds are given. Moreover, an algorithm with O (n ) expected running time is présentée.