The stable marriage problem with restricted pairs.

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)

zbMATH Keywords

Algorithms; Rotations; Forbidden pairs; Forced pairs; Stable marriage

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

Related Items

New and simple algorithms for stable flow problems, An algorithm for a super-stable roommates problem, The stable marriage problem with ties and restricted edges, Efficient algorithms for generalized stable marriage and roommates problems, Stable marriage and roommates problems with restricted edges: complexity and approximability, Popular edges and dominant matchings, 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?, How should we solve search problems privately?, Stable matchings with covering constraints: a complete computational trichotomy, Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability

Cites Work

• Unnamed Item
• The Complexity of Counting Stable Marriages
• Three Fast Algorithms for Four Problems in Stable Marriage
• College Admissions and the Stability of Marriage
• Efficient algorithms on distributive lattices