@inbook{5e7c6c390525420d87ddb4008cce929f,
title = "Revisiting two-sided stability constraints",
abstract = "We show that previous filtering propositions on two-sided stability problems do not enforce arc consistency (AC), however they maintain bound(D) consistency (BC(D)). We propose an optimal algorithm achieving BC(D) with O(L) time complexity where L is the length of the preference lists. We also show an adaptation of this filtering approach to achieve AC. Next, we report the first polynomial time algorithm for solving the hospital/resident problem with forced and forbidden pairs. Furthermore, we show that the particular case of this problem for stable marriage can be solved in O(n2) which improves the previously best complexity by a factor of n2. Finally, we present a comprehensive set of experiments to evaluate the filtering propositions.",
author = "Mohamed Siala and Barry O{\textquoteright}Sullivan",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2016 ; Conference date: 29-05-2016 Through 01-06-2016",
year = "2016",
doi = "10.1007/978-3-319-33954-2\_25",
language = "English",
isbn = "9783319339535",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "342--357",
editor = "Claude-Guy Quimper",
booktitle = "Integration of AI and OR Techniques in Constraint Programming - 13th International Conference, CPAIOR 2016, Proceedings",
address = "Germany",
}