This is a preview. Log in through your library . Abstract Our main contribution is an O(n log n) algorithm that determines with high probability a perfect matching in a random 2-out bipartite graph.
The Journal of the Operational Research Society, Vol. 55, No. 7, Part Special Issue: Local Search (Jul., 2004), pp. 694-704 (11 pages) The multi-index assignment problem (MIAP) with decomposable costs ...
Reviewer assignment algorithms and systems have emerged as critical tools in modern academic publishing and research evaluation, ensuring that submitted manuscripts are matched with expert reviewers ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback