A new class of heuristic algorithms for weighted perfect matching

DOI10.1145/48014.48015zbMath0662.68068OpenAlexW1996358566MaRDI QIDQ3813310

Bahman Kalantari, Michael D. Grigoriadis

Publication date: 1988

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/48014.48015

zbMATH Keywords

complexityheuristicscombinatorial optimizationerror boundsHamiltoniansapproximate algorithmsminimum-weight perfect matchingEuler torus

Mathematics Subject Classification ID

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

Related Items (4)

New primal and dual matching heuristics ⋮ AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ A generalized hypergreedy algorithm for weighted perfect matching ⋮ A greedy heuristic for a minimum-weight forest problem

This page was built for publication: A new class of heuristic algorithms for weighted perfect matching