A polynomial-time algorithm for the bistable roommates problem
10.1006/jcss.2001.1791
Saved in:
Main Authors: | Sethuraman, J., Teo, C.-P. |
---|---|
Other Authors: | DECISION SCIENCES |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/44920 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
The geometry of fractional stable matchings and its applications
by: Teo, C.-P., et al.
Published: (2013) -
Many-to-one stable matching: Geometry and fairness
by: Sethuraman, J., et al.
Published: (2013) -
CHARACTERIZE WEAK AND SUPER STABILITY OF THE ROOMMATE PROBLEM UNDER WEAK PREFERENCES
by: YU BIN
Published: (2024) -
Bistability in microcavities with incoherent optical or electrical excitation
by: Kyriienko, Oleksandr, et al.
Published: (2017) -
Polymer memories: Bistable electrical switching and device performance
by: Ling, Q.-D., et al.
Published: (2014)