The Probabilistic Analysis of a Heuristic for the Assignment Problem

DOI10.1137/0217047zbMath0651.68084OpenAlexW2020777270MaRDI QIDQ3796776

No author found.

Publication date: 1988

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0217047

zbMATH Keywords

heuristicassignment problemprobabilistic analysis of algorithmsperfect matchingweighted matchingsweighted complete bipartite graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck ⋮ Random assignment problems ⋮ An analysis of a decomposition heuristic for the assignment problem

This page was built for publication: The Probabilistic Analysis of a Heuristic for the Assignment Problem