Faster and simpler approximation of stable matchings

Details Faster and simpler approximation of stable matchings Faster and simpler approximation of stable matchings

2009-11-30

arxiv.org/abs/0911.5660v4

Computer Science

Data Structures and Algorithms

Scientific paper

We give a 3/2-approximation algorithm for stable matchings that runs in $O(m)$ time. The previously best known algorithm by McDermid has the same approximation ratio but runs in $O(n^{3/2}m)$ time, where $n$ denotes the number of people and $m$ is the total length of the preference lists in a given instance. Also the algorithm and the analysis are much simpler. We also give the extension of the algorithm for the many-to-many setting.

Affiliated with

Also associated with

No associations

Rating

Faster and simpler approximation of stable matchings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Faster and simpler approximation of stable matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster and simpler approximation of stable matchings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149391