Average case performance of heuristics for multi-dimensional assignment problems
Discrete Mathematics
2010-04-27 v1
Abstract
We consider multi-dimensional assignment problems in a probabilistic setting. Our main results are: (i) A new efficient algorithm for the 3-dimensional planar problem, based on enumerating and selecting from a set of "alternating-path trees"; (ii) A new efficient matching-based algorithm for the 3-dimensional axial problem.
Cite
@article{arxiv.1004.4239,
title = {Average case performance of heuristics for multi-dimensional assignment problems},
author = {Alan Frieze and Gregory Sorkin},
journal= {arXiv preprint arXiv:1004.4239},
year = {2010}
}