Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142470 | Operations Research Letters | 2012 | 5 Pages |
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 mm-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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Trivikram Dokka, Anastasia Kouvela, Frits C.R. Spieksma,