Please use this identifier to cite or link to this item: https://doi.org/10.1006/jcss.2001.1791
DC FieldValue
dc.titleA polynomial-time algorithm for the bistable roommates problem
dc.contributor.authorSethuraman, J.
dc.contributor.authorTeo, C.-P.
dc.date.accessioned2013-10-10T04:37:43Z
dc.date.available2013-10-10T04:37:43Z
dc.date.issued2001
dc.identifier.citationSethuraman, J., Teo, C.-P. (2001). A polynomial-time algorithm for the bistable roommates problem. Journal of Computer and System Sciences 63 (3) : 486-497. ScholarBank@NUS Repository. https://doi.org/10.1006/jcss.2001.1791
dc.identifier.issn00220000
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/44920
dc.description.abstractIn 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) results for the bistable marriage and roommates problem become transparent using the polyhedral approach. This technique has been used recently by the authors to address classical stable matching problems.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1006/jcss.2001.1791
dc.sourceScopus
dc.subjectBistability
dc.subjectLinear programming
dc.subjectRounding
dc.subjectStable matching
dc.typeArticle
dc.contributor.departmentDECISION SCIENCES
dc.description.doi10.1006/jcss.2001.1791
dc.description.sourcetitleJournal of Computer and System Sciences
dc.description.volume63
dc.description.issue3
dc.description.page486-497
dc.description.codenJCSSB
dc.identifier.isiut000174490900008
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

7
checked on Sep 17, 2019

WEB OF SCIENCETM
Citations

6
checked on Sep 17, 2019

Page view(s)

84
checked on Sep 9, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.