Faster Algorithms for Stable Allocation Problems

13 years 11 months ago

We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba

Brian C. Dean, Siddharth Munshi

ALGORITHMICA 2010 | Nonbipartite Stable Allocation | Stable Allocation Problem | Stable Matching Problem |

claim paper

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	ALGORITHMICA
Authors	Brian C. Dean, Siddharth Munshi

Comments (0)