✦ LIBER ✦

Worst-case choice for the stable marriage problem

✍ Scribed by Deepak Kapur; Mukkai S. Krishnamoorthy

Book ID: 113162831
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 268 KB
Volume: 21
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(85)90104-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comment on “Worst-case choice for the st

Comment on “Worst-case choice for the stable marriage problem” [2]

✍ A.K. Pujari; S. Gupta 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 82 KB

The exchange-stable marriage problem

✍ Katarína Cechlárová; David F. Manlove 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Worst case bounds for the Euclidean matc

Worst case bounds for the Euclidean matching problem

✍ David Avis 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 424 KB

A diagrammatic classification in a combi

A diagrammatic classification in a combinatorial problem: the case of the stable marriage problem

✍ T. Hayashi; Y. Hata; Y. Ishida 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 366 KB

New worst-case results for the bin-packi

New worst-case results for the bin-packing problem

✍ David Simchi-Levi 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB

The stable marriage problem with restric

The stable marriage problem with restricted pairs

✍ Vânia M.F. Dias; Guilherme D. da Fonseca; Celina M.H. de Figueiredo; Jayme L. Sz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other to their actual partners under the matching. In an instance of the STABLE MARRIAGE problem, each of the n men and n women ranks the members of the opposite sex in order of