✦ LIBER ✦

An algorithm for a super-stable roommates problem

✍ Scribed by Tamás Fleiner; Robert W. Irving; David F. Manlove

Book ID: 113927548
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 221 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.09.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for the “stable r

An efficient algorithm for the “stable roommates” problem

✍ Robert W Irving 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 938 KB

A maximum stable matching for the roomma

A maximum stable matching for the roommates problem

✍ Jimmy J. M. Tan 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 704 KB

Solutions for the stable roommates probl

Solutions for the stable roommates problem with payments

✍ Biró, Péter; Bomhoff, Matthijs; Golovach, Petr A.; Kern, Walter; Paulusma, Danië 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 307 KB

A Polynomial-time Algorithm for the Bist

A Polynomial-time Algorithm for the Bistable Roommates Problem

✍ Jay Sethuraman; Chung-Piaw Teo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

The stable fixtures problem—A many-to-ma

The stable fixtures problem—A many-to-many extension of stable roommates

✍ Robert W. Irving; Sandy Scott 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 275 KB

On a cutting plane heuristic for the sta

On a cutting plane heuristic for the stable roommates problem and its applications

✍ Chung-Piaw Teo; Jay Sethuraman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 138 KB