Work

A Simple Approximation Algorithm for the Modified Bottleneck Assignment Problem in Vector Case

Year: 2016

Type: article

Abstract: 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.

Source: International Journal of Computer Theory and Engineering

DOI: 10.7763/ijcte.2016.v8.1034

Authors: Yuusaku Kamura, Mario Nakamori

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2567028062

FWCI:

Cites: 13

Cited by: 1

Related to: 10