Library Header Image
LSE Research Online LSE Library Services

Approximating the multi-level bottleneck assignment problem

Dokka, Trivikram, Kouvela, Anastasia and Spieksma, Frits C. R. (2012) Approximating the multi-level bottleneck assignment problem. In: Rahman, Md. Saidur and Nakano, Shin-ichi, (eds.) Walcom: Algorithms and Computation: 6th International Workshop, Walcom 2012, Dhaka, Bangladesh, February 15-17, 2012: Proceeding. Lecture notes in computer science (7157). Springer Berlin / Heidelberg, Berlin, pp. 64-75. ISBN 9783642280764

Full text not available from this repository.
Identification Number: 10.1007/978-3-642-28076-4_9


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.

Item Type: Book Section
Official URL:
Additional Information: © 2012 Springer-Verlag
Divisions: LSE
Subjects: Q Science > QA Mathematics
Date Deposited: 28 Mar 2012 16:00
Last Modified: 02 Jan 2024 06:36

Actions (login required)

View Item View Item