Abstract

We present improved algorithms for finding approximately optimal matchings in both weighted and unweighted graphs. For unweighted graphs, we give an algorithm providing (1 − ɛ)-approximation in O(log n) time for any constant ɛ> 0. This result improves on the classical 1-approximation due 2 to Israeli and Itai. As a by-product, we also provide an improved algorithm for unweighted matchings in bipartite graphs. In the context of weighted graphs, we give another algorithm which provides ( 1 − ɛ) approximation in general 2 graphs in O(log n) time. The latter result improves on the − ɛ)-approximation in O(log n) time. known ( 1 4

Citations