On the expected value of the minimum assignment

DOI10.1002/rsa.10045zbMath1006.90051arXivmath/0004175OpenAlexW2161369484MaRDI QIDQ3150198

David P. Robbins, Clara S. Chan, Marshall W. Buck

Publication date: 12 March 2003

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0004175

zbMATH Keywords

minimum assignment

Mathematics Subject Classification ID

Combinatorial probability (60C05) Discrete location and assignment (90B80) Randomized algorithms (68W20)

Related Items (10)

On the Maximum of a Special Random Assignment Process ⋮ On the maximum of random assignment process ⋮ The mean field traveling salesman and related problems ⋮ Exploiting partial correlations in distributionally robust optimization ⋮ The Blind Passenger and the Assignment Problem ⋮ Random assignment problems ⋮ Efficient algorithms for three‐dimensional axial and planar random assignment problems ⋮ A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment ⋮ Uncertain random assignment problem ⋮ The \(k\)-assignment polytope

This page was built for publication: On the expected value of the minimum assignment