Results 21 to 30 of about 7,398,457 (268)
Local Search Approaches in Stable Matching Problems
Algorithms, 2013 The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market.
Toby Walsh +4 more
doaj +1 more source
Matching Transportation Ontologies with Word2Vec and Alignment Extraction Algorithm
Journal of Advanced Transportation, 2021 The development of intelligent transportation systems (ITSs) faces the challenge of integrating data from multiple unrelated sources. As one of the core technologies of knowledge integration in ITS, an ontology typically provides a normative definition ...
Xingsi Xue +5 more
doaj +1 more source
IEEE Access, 2021 Blind-spots, where wireless signals do not reach within the coverage range, often emerge in a dynamic environment due to obstacles, geographical location or mobility of cellular users (CUs).
Adeel Iqbal +9 more
doaj +1 more source
Randomized approximation of the stable marriage problem
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Magnús M. Halldórsson +3 more
openaire +1 more source
Scaling Behavior in the Stable Marriage Problem [PDF]
Journal de Physique I, 1997 6 pages, revtex, 3 figures. To appear in J. de Physique I, vol 7, No 12 (December)
Oméro, Marie-José +3 more
openaire +3 more sources
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists
Algorithms, 2013 In the stable marriage problem, any instance admits the so-called man-optimal stable matching, in which every man is assigned the best possible partner.
Shuichi Miyazaki +4 more
doaj +1 more source
Applied Sciences, 2023 A critical part of Automated Material Handling Systems (AMHS) is the task allocation and dispatching strategy employed. In order to better understand and investigate this component, we here present an extensive experimental evaluation of three different ...
Fabian Maas genannt Bermpohl +2 more
doaj +1 more source
Popular Matchings in the Stable Marriage Problem
Information and Computation, 2011 We consider the problem of computing a maximum cardinality popular matching in a bipartite graph G=(A@?B,E) where each vertex u@?A@?B ranks its neighbors in a strict order of preference. Such a graph is called an instance of the stable marriage problem with strict preferences and incomplete lists. A matching M^@? is popular if for every matching M in G,
Chien-Chung Huang 0001 +1 more
openaire +1 more source
Linear Time Local Approximation Algorithm for Maximum Stable Marriage
Algorithms, 2013 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,
Zoltán Király
doaj +1 more source
A Note on the Uniqueness of Stable Marriage Matching
Discussiones Mathematicae Graph Theory, 2013 In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of odd
Drgas-Burchardt Ewa
doaj +1 more source