Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ALGORITHMICA
2010

favoriteEmaildiscussreport

122views more ALGORITHMICA 2010»

Faster Algorithms for Stable Allocation Problems

13 years 4 months ago

Faster Algorithms for Stable Allocation Problems

Download www.cs.clemson.edu

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

Real-time Traffic

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

claim paper

Related Content

» The StudentProject Allocation Problem

» Stable matching problems with exchange restrictions

» Honey bee social foraging algorithms for resource allocation Theory and application

» Hippocampus segmentation using a stable maximum likelihood classifier ensemble algorithm

» StudentProject Allocation with preferences over Projects

» A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented ...

» Hybrid Evolutionary Algorithm Based Solution for Register Allocation for Embedded Systems

» Efficient and Numerically Stable Sparse Learning

» Finite Termination of Augmenting Path Algorithms in the Presence of Irrational Problem Dat...

Post Info
More Details (n/a)

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

Comments (0)