Faster and Simpler Approximation of Stable Matchings
نویسنده
چکیده
We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(nm) time, where n denotes the number of people and m is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.
منابع مشابه
A Simpler and Faster Version of Two-Dimensional Gel Electrophoresis Using Vertical, Mini SDS-PAGE Apparatus
We have modified one of the most useful methods of protein separation; namely, two dimensional gel electrophoresis (2-DE). This modified version of 2-DE is not only simpler and easier but also faster than all the currently available methods. In this method, isoelectric focusing is carried out in the first dimension using a vertical sodium dodecyl sulfate polyacrylamide gel electrop...
متن کاملThe Complexity of Approximately Counting Stable Matchings
We investigate the complexity of approximately counting stable matchings in the k-attribute model, where the preference lists are determined by dot products of “preference vectors” with “attribute vectors”, or by Euclidean distances between “preference points“ and “attribute points”. Irving and Leather [16] proved that counting the number of stable matchings in the general case is #P -complete....
متن کاملApproximately Counting Perfect Matchings in General Graphs
So far only one approximation algorithm for the number of perfect matchings in general graphs is known. This algorithm of Chien [2] is based on determinants. We present a much simpler algorithm together with some of its variants. One of them has an excellent performance for random graphs, another one might be a candidate for a good worst case performance. We also present an experimental analysi...
متن کاملTwo-sided popular matchings in bipartite graphs with forbidden/forced elements and weights
Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching. Popular matchings allow for assignments of larger size while still guaranteeing a certain fair...
متن کاملThe center stable matchings and the centers of cover graphs of distributive lattices
Let I be an instance of the stable marriage (SM) problem. In the late 1990s, Teo and Sethuraman discovered the existence of median stable matchings, which are stable matchings that match all participants to their (lower/upper) median stable partner. About a decade later, Cheng showed that not only are they locally-fair, but they are also globally-fair in the following sense: when G(I) is the co...
متن کامل