Answers are grounded in this paper and cite their sources.
This survey paper reviews results on heuristics for two weighted matching problems: matchings where the vertices are points in the plane and weights are Euclidean distances, and the assignment problem. Several heuristics are described in detail and results are given for worst‐case ratio bounds, absolute bounds, and expected bounds. Applications to practical problems and some mathematical complements are also included.
No takes yet. Share an insight, caveat, or question.
David Avis (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: