A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors

DOI10.1007/PL00009172zbMath0887.68045OpenAlexW2139491049MaRDI QIDQ1361421

Bahman Kalantari, Celina Imielinska

Publication date: 23 July 1997

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009172

zbMATH Keywords

heuristic algorithmsperfect matching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

A greedy heuristic for a minimum-weight forest problem

This page was built for publication: A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors