@inproceedings{b30f9e38949e4b3f9bfd028fecb5a3df,

title = "Approximating the multi-level bottleneck assignment problem",

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. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximability results, depending upon the completeness of the underlying graph.",

keywords = "approximation, bottleneck problem, computational complexity, efficient algorithm, multidimensional assignment",

author = "T. Dokka and A. Kouvela and F.C.R. Spieksma",

year = "2012",

doi = "10.1007/978-3-642-28076-4_9",

language = "English",

isbn = "978-3-642-28075-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "64--75",

editor = "M.S. Rahman and S. Nakano",

booktitle = "WALCOM",

address = "Germany",

note = "6th International Workshop on Algorithms and Computation, WALCOM 2012 ; Conference date: 15-02-2012 Through 17-02-2012",

}