On the Inverse Maximum Perfect Matching Problem Under the Bottleneck-Type Hamming Distance

Given an undirected network g(v, a, c) and a perfect matching m of g, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that m becomes a maximum perfect matching with respect to the modified vector. in this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type hamming distance. we propose an algorithm based on the binary search technique for solving the problem. our proposed algorithm has a better time complexity than the one presented in [13]. we also study the inverse assignment problem as a special case of the inverse maximum perfect matching problem in which the network is bipartite and present an efficient algorithm for solving the problem. finally, we compare the algorithm with those presented in the literature.