Results 221 to 230 of about 236,951 (263)
Comparative Effectiveness and Safety of Rituximab Versus Ocrelizumab in Relapsing-Remitting Multiple Sclerosis: A Finnish Population-Based Matched Cohort Study. [PDF]
Eur J NeurolSavolainen M +6 more
europepmc +1 more source
Politicization of Graduate Medical Education Antitrust Exemption Obscures Real Workforce Issues and Solutions. [PDF]
J Grad Med EducDotson SJ, Curtin LS.
europepmc +1 more source
Stable schedule matchings [PDF]
Acta Mathematica Hungarica, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vilmos Komornik +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Stable matchings and stable partitions
International Journal of Computer Mathematics, 1991Recently Tan [7] defined a new structure for the stable roommates problem, called a “stable partition” which is a generalization of the notion of the stable matching. He proved that every instance of that problem contains at least one such structure, and obtained a succinct certificate of the non-existence of a stable matching. In this paper.
openaire +1 more source
Stable Matching with Proportionality Constraints
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017School choice programs seek to give students the option to choose their school but also close an opportunity gap. To be fair in the assignment of students, it is usually argued that the assignment of students to schools should be stable. This second concern is usually expressed in terms of proportions. As an example, in 1989, the city of White Plains,
Thành Nguyen 0001, Rakesh Vohra
openaire +1 more source
2017
The maximum stable matching problem (Max-SMP) and the minimum stable matching problem (Min-SMP) have been known to be NP-hard for subcubic bipartite graphs, while Max-SMP can be solved in polynomal time for a bipartite graph G with a bipartition (X, Y) such that \(\mathrm{deg}_{G}(v)\le 2\) for any \(v\in X\). This paper shows that both Max-SMP and Min-
Satoshi Tayu, Shuichi Ueno
openaire +1 more source
The maximum stable matching problem (Max-SMP) and the minimum stable matching problem (Min-SMP) have been known to be NP-hard for subcubic bipartite graphs, while Max-SMP can be solved in polynomal time for a bipartite graph G with a bipartition (X, Y) such that \(\mathrm{deg}_{G}(v)\le 2\) for any \(v\in X\). This paper shows that both Max-SMP and Min-
Satoshi Tayu, Shuichi Ueno
openaire +1 more source
2006
Stable matching is one of the oldest problems studied from an algorithmic point of view, whose original version is defined as follows: An instance consists of N men, N women, and each person's preference list. A preference list is a totally ordered list including all members of the opposite sex depending on his/her preference.
openaire +1 more source
Stable matching is one of the oldest problems studied from an algorithmic point of view, whose original version is defined as follows: An instance consists of N men, N women, and each person's preference list. A preference list is a totally ordered list including all members of the opposite sex depending on his/her preference.
openaire +1 more source
Stable Matching with Network Externalities
Algorithmica, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elliot Anshelevich +2 more
openaire +2 more sources