—We deal with the modified bottleneck assignment problem in vector case. The problem is to find the complete matching between two vector sets that minimizes the maximum sum of vectors' elements. In scalar case, there is a simple polynomial time algorithm that uses the order of elements' value. We extend this problem to the 2 dimensional vector case and propose a simple approximation algorithm for it. We show the effectiveness of our algorithm by numerical experiments.
—Approximation algorithm, assignment problem, balanced assignment problem.
Y. Kamura is with Academic Planning Center, Hitotsubashi University, Kunitachi, Tokyo 186-8601, Japan (e-mail: firstname.lastname@example.org).
M. Nakamori was with Tokyo University of Agriculture and Technology, Koganei, Tokyo 184-8588, Japan. He is now with MOC Co, Ltd. Japan (e-mail: email@example.com).
Cite:Yuusaku Kamura and Mario Nakamori, "A Simple Approximation Algorithm for the Modified Bottleneck Assignment Problem in Vector Case," International Journal of Computer Theory and Engineering vol. 8, no. 2, pp. 145-149, 2016.