The Partitioning Min-Max Weighted Matching Problem
In this chapter we consider a variant of the strongly NP-hard Min-Max Weighted Matching (MMWM) Problem, that has recently been introduced by Barketau et al. (2015) as in Kress et al. (2015). An instance of MMWM is defined by an edge-weighted bipartite graph G(U; V;E) with disjoint vertex sets U and V (bipartitions), edge set E, and a partitioning of U into disjoint subsets (components). Given a maximum matching on G, the weight of a component is defined as the sum of the weights of the edges of the matching that are incident to the vertices of the component.
Unable to display preview. Download preview PDF.