Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Between a rock and a hard place: the two-to-one assignment problem|
|Citation:||Lecture Notes in Artificial Intelligence, 2010 / Bampis, E., Jansen, K. (ed./s), vol.5893 LNCS, pp.159-169|
|Series/Report no.:||Lecture Notes in Computer Science; 5893|
|Conference Name:||7th International Workshop on Approximation and Online Algorithms (10 Sep 2009 - 11 Sep 2009 : Copenhagen, Denmark)|
|Dries Goossens, Sergey Polyakovskiy, Frits C.R. Spieksma, and Gerhard J. Woeginger|
|Abstract:||We describe the two-to-one assignment problem, a problem in between the axial three-index assignment problem and the three-dimensional matching problem, having applications in various domains. For the (relevant) case of decomposable costs satisfying the triangle inequality we provide, on the positive side, two constant factor approximation algorithms. These algorithms involve solving minimum weight matching problems and transportation problems, leading to a 2-approximation, and a 3/2-approximation. Moreover, we further show that the best of these two solutions is a 4/3-approximation for our problem. On the negative side, we show that the existence of a polynomial time approximation scheme for our problem would imply P=NP.|
|Keywords:||Assignment problem matching problem; efficient algorithm; approximation;|
|Rights:||© Springer-Verlag Berlin Heidelberg 2010|
|Appears in Collections:||Aurora harvest 2|
Computer Science publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.