Linear Time Local Approximation Algorithm for Maximum Stable Marriage
نویسندگان
چکیده
منابع مشابه
Linear Time Local Approximation Algorithm for Maximum Stable Marriage
We consider a two-sided market under incomplete preference lists with ties, where the goal is to find a maximum size stable matching. The problem is APX-hard, and a 3/2-approximation was given by McDermid [1]. This algorithm has a non-linear running time, and, more importantly needs global knowledge of all preference lists. We present a very natural, economically reasonable, local, linear time ...
متن کامل)–Approximation Algorithm for the Stable Marriage Problem
We propose an approximation algorithm for the problem of finding a maximum stable matching when both ties and unacceptable partners are allowed in preference lists. Our algorithm achieves the approximation ratio 2− c logN N for an arbitrarily positive constant c, where N denotes the number of men in an input. This improves the trivial approximation ratio of two.
متن کاملApproximation Algorithms for Stable Marriage Problems
Approximation Algorithms for Stable Marriage Problems Hiroki Yanagisawa Kyoto University, Japan 2007 The stable marriage problem is a classical matching problem introduced by Gale and Shapley. An instance of the stable marriage problem consists of men and women, where each person totally orders all members of the opposite sex. A matching is stable if there is no pair that prefer each other to t...
متن کاملSimple linear time approximation algorithm for betweenness
We present a simple linear time combinatorial algorithm for the Betweenness problem. In the Betweenness problem, we are given a set of vertices and betweenness constraints. Each betweenness constraint of the form x {y, z} requires that vertex x lies between vertices y and z. Our goal is to find a linear ordering of vertices that maximizes the number of satisfied constraints. In 1995, Chor and S...
متن کاملDelay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems
In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2013
ISSN: 1999-4893
DOI: 10.3390/a6030471