On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems

In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices with a color (or label) function L : E → {c1, . . . , cq}, the labeled maximum matching problem consists in finding a maximum matching on G that uses a minimum or a maximum number of colors.

• Type: Conference
• Year: 2005
• Where: ISAAC
• Authors: Jérôme Monnot
• Keywords: ISAAC 2005, Matching Problem, Maximum Matching, Perfect Matching Problem