### A new class of heuristic algorithms for weighted perfect matchingA new class of heuristic algorithms for weighted perfect matching

Access Restriction
Subscribed

 Author Grigoriadis, M. D. ♦ Kalantari, B. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1988 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract The minimum-weight perfect matching problem for complete graphs of $\textit{n}$ vertices with edge weights satisfying the triangle inequality is considered. For each nonnegative integer $\textit{k}$ ≤ $log3\textit{n},$ and for any perfect matching algorithm that runs in $\textit{t}(\textit{n})$ time and has an error bound of $ƒ(\textit{n})$ times the optimal weight, an $\textit{O}(max{\textit{n}2,$ $\textit{t}(3\textit{-k}\textit{n})})-time$ heuristic algorithm with an error bound of (7/3)k(1 + ƒ(3 $k}\textit{n}))$ - 1 is given. By the selection of $\textit{k}$ as appropriate functions of $\textit{n},$ heuristics that have better running times and/or error bounds than existing ones are derived. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1988-10-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 35 Issue Number 4 Page Count 8 Starting Page 769 Ending Page 776

#### Open content in new tab

Source: ACM Digital Library