Maximum weight edge-constrained matchings

Abstract

Practical questions arising from (for instance) biological applications can often be expressed as classical optimization problems with specific, new features. We are interested here in the version of the maximum weight matching problem (on a graph G ) obtained by (1) defining a set F of pairs of incompatible edges of G and (2) asking that the matching contains at most one edge in each given pair. Such a matching is called an odd matching. The graph T ( F ) = ( V F , F ) , where V F is the set of edges of G occurring in at least one pair of F , is called the trace-graph of G and F . We motivate the introduction of the maximum weight odd-matching (abbreviated as Odd-MWM) problem and study its complexity with respect to two parameters: the type of graph G and the graph class T to which T ( F ) belongs. Our contribution includes: • A proof that Odd-MWM is NP-complete for 3-degree bipartite graphs when T ( F ) is a matching (i.e. when T is the class of 1-regular graphs), even if the weight function is constant. • A proof that Odd-MWM is NP-complete (for 3-degree bipartite graphs as well as for any larger class) if and only if T is a class of graphs with unbounded induced matching. Otherwise, Odd-MWM is polynomial. • A ( Δ ( T ( F ) ) + 1 ) -approximate algorithm for Odd-MWM on general graphs. This algorithm becomes a χ ( T ( F ) ) -approximate algorithm when the graph class T admits a polynomial algorithm for minimum vertex coloring.