Biro, P. and Fleiner, T. (2010) The integral stable allocation problem on graphs. Discrete Optimization, 7(1-2), pp. 64-73. (doi: 10.1016/j.disopt.2010.02.002)
Full text not currently available from Enlighten.
Publisher's URL: http://dx.doi.org/10.1016/j.disopt.2010.02.002
Abstract
As a generalisation of the stable matching problem Baton and Balinski (2002) 111 defined the stable allocation problem for bipartite graphs, where both the edges and the vertices may have capacities. They constructed a so-called inductive algorithm, that always finds a stable allocation in strongly polynomial time. Here, we generalise their algorithm for non-bipartite graphs with integral capacities. We show that the algorithm does not remain polynomial, although we also present a scaling technique that makes the algorithm weakly polynomial.
Item Type: | Articles |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Biro, Dr Peter |
Authors: | Biro, P., and Fleiner, T. |
College/School: | College of Science and Engineering > School of Computing Science |
Journal Name: | Discrete Optimization |
Publisher: | Elsevier |
ISSN: | 1572-5286 |
ISSN (Online): | 1873-636X |
Published Online: | 07 March 2010 |
University Staff: Request a correction | Enlighten Editors: Update this record