The Random Linear Bottleneck Assignment Problem

  title={The Random Linear Bottleneck Assignment Problem},
  author={Ulrich Pferschy},
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. 
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 12 extracted citations


Publications referenced by this paper.
Showing 1-10 of 16 references

The shortest augmenting path method for solving assignment problems, Annals of Opérations Research, 1985, 4, pp

  • 57-102. vol 30, n° 2,
  • 1996
1 Excerpt

Graphical Evolution, J

  • E. M. PALMER
  • Wiley & Sons,
  • 1985
2 Excerpts

and A

  • THOMASON, Random graphs of small order, Random…
  • 1985

An upper bound on the expected cost ofan optimal assignment, Technical report, Computer Se

  • R. M. KARP
  • Div., Univ. of California, Berkeley,
  • 1984
1 Excerpt

An upper bound on the expected cost of an optimal assignment

  • R. M. Karp
  • 1980

KARP, An algorithm to solve the m x n assignment problem in expected time 0(mn logn)

  • R M.
  • 1980

WALKUP, Matchings in random regular bipartite digraphs

  • D W.
  • Discrete Mathematics, 1980,
  • 1980
1 Excerpt

and U

  • R. E. BURKAR
  • DERIGS, Assignment and Matching Problems…
  • 1980
1 Excerpt

Similar Papers

Loading similar papers…