A polynomial-time algorithm for the bistable roommates problem

Journal of Computer and System Sciences

Volumn 63, Issue 3, 2001, Pages 486-497

  Sethuraman, Jay ^a   Teo, Chung Piaw ^b,c  

^a Columbia University ^*  (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c SINGAPORE MIT ALLIANCE   (Singapore)

Author keywords

Bistability; Linear programming; Rounding; Stable matching

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL GEOMETRY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; TIME SERIES ANALYSIS;

BISTABLE ROOMMATES PROBLEM; POLYHEDRAL APPROACH; POLYNOMIAL-TIME ALGORITHM; STABLE MATCHING;

ALGORITHMS;

EID: 0035521329     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1791     Document Type: Article

References (12)

1. College admissions and the stability of marriage
2. Geometric Algorithms and Combinatorial Optimization
3. An efficient algorithm for the stable roommates problem
4. Stable matching, optimal assignments and linear programming
5. Characterization of stable matchings as extreme points of a polytope
6. Geometry of fractional stable matchings and its applications
7. On a cutting plane heuristic for the optimal stable roommates problem
8. Linear programming brings marital bliss
9. Bistable versions of the marriages and roommates problems