A lower bound on the expected cost of an optimal assignment

Authors:
Michel X. Goemans;Muralidharan S. Kodialam
Affiliations:
-;-
Venue:
Mathematics of Operations Research
Year:
1993

Citing 0
Cited 3

Constructive Bounds and Exact Expectations for the Random Assignment Problem

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures

Random Structures & Algorithms
Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract