Dokka, Trivikram, Kouvela, Anastasia and Spieksma, Frits C.R. (2012) Approximating the multi-level bottleneck assignment problem. Operations research letters, 40 (4). pp. 282-286. ISSN 0167-6377
Abstract
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book "Assignment Problems" by Burkard et al. (2009) on pages 188-189, where its complexity status is called open. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem and settle its complexity status. We give approximation algorithms and inapproximability results, depending upon the completeness of the underlying graph.
| Item Type: | Article |
|---|---|
| Official URL: | http://www.journals.elsevier.com/operations-resear... |
| Additional Information: | © 2012 Elsevier |
| Uncontrolled Keywords: | ISI, approximation, bottleneck problem, computational complexity, efficient algorithm, multidimensional assignment |
| Library of Congress subject classification: | Q Science > QA Mathematics |
| Sets: | Research centres and groups > Management Science Group |
| Rights: | http://www.lse.ac.uk/library/rights/LSERO.htm |
| URL: | http://eprints.lse.ac.uk/43861/ |
Actions (login required)
 |
Record administration - authorised staff only |
