The stable marriage problem with restricted pairs.
From MaRDI portal
Publication:1426462
DOI10.1016/S0304-3975(03)00319-0zbMath1059.68157MaRDI QIDQ1426462
Vânia M. F. Dias, Jayme Luiz Szwarcfiter, Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (11)
Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability ⋮ Constrained stable marriage with free edges or few blocking pairs ⋮ The core of housing markets from an agent's perspective: Is it worth sprucing up your home? ⋮ An algorithm for a super-stable roommates problem ⋮ Stable marriage and roommates problems with restricted edges: complexity and approximability ⋮ How should we solve search problems privately? ⋮ New and simple algorithms for stable flow problems ⋮ Efficient algorithms for generalized stable marriage and roommates problems ⋮ Popular edges and dominant matchings ⋮ Stable matchings with covering constraints: a complete computational trichotomy ⋮ The stable marriage problem with ties and restricted edges
Cites Work
This page was built for publication: The stable marriage problem with restricted pairs.