The stable crews problem

Authors:
Katarína Cechlárová;Soňa Ferková
Affiliations:
Institute of Mathematics, Faculty of Science, P.J. Safárik University, Jesenná 5, 041 54 Kosice, Slovakia;Tatra Banka, a. s., Software Development Department, IT Division, Hodzovo nám., 81 421 Bratislava, Slovakia
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 4
Cited 4

The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
NP-complete stable matching problems

Journal of Algorithms
Three-dimensional stable matching problems

SIAM Journal on Discrete Mathematics
The stable roommates problem with ties

Journal of Algorithms

On a generalization of the stable roommates problem

ACM Transactions on Algorithms (TALG)
On the stable b-matching problem in multigraphs

Discrete Applied Mathematics
Rotations in the stable b-matching problem

Theoretical Computer Science
The integral stable allocation problem on graphs

Discrete Optimization

Quantified Score

Hi-index	0.05

Visualization

Abstract

In this paper the classical stable roommates problem is generalized to situations when the two partners in a pair perform different roles. We propose an efficient algorithm to decide the existence of a stable matching in this problem.