The labeled perfect matching in bipartite graphs

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 |V|=2n vertices such that E contains a perfect matching (of size n), together with a color (or label) function L:E->{c"1,...,c"q}, the labeled perfect matching problem consists in finding a perfect matching on G that uses a minimum or a maximum number of colors.

[1]  Sven Oliver Krumke,et al.  On the Minimum Label Spanning Tree Problem , 1998, Inf. Process. Lett..

[2]  Madhav V. Marathe,et al.  On Approximation Algorithms for the Minimum Satisfiability Problem , 1996, Inf. Process. Lett..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Marek Karpinski,et al.  Approximation Hardness of Short Symmetric Instances of MAX-3SAT , 2003, Electron. Colloquium Comput. Complex..

[5]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[6]  David P. Williamson,et al.  Improved approximation algorithms for MAX SAT , 2000, SODA '00.

[7]  Xueliang Li,et al.  Spanning trees with many or few colors in edge-colored graphs , 1997, Discuss. Math. Graph Theory.

[8]  Bruce L. Golden,et al.  Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem , 2005, Oper. Res. Lett..

[9]  Ruay-Shiung Chang,et al.  The Minimum Labeling Spanning Trees , 1997, Inf. Process. Lett..

[10]  Katta G. Murty,et al.  Matchings in colored bipartite networks , 2002, Discret. Appl. Math..

[11]  Guoliang Chen,et al.  A note on the minimum label spanning tree , 2002, Inf. Process. Lett..

[12]  Viggo Kann,et al.  Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..

[13]  Alon Itai,et al.  Some Matching Problems for Bipartite Graphs , 1978, JACM.

[14]  Kathie Cameron,et al.  Coloured matchings in bipartite graphs , 1997, Discret. Math..

[15]  Robert D. Carr,et al.  On the red-blue set cover problem , 2000, SODA '00.

[16]  Gerhard J. Woeginger,et al.  Local search for the minimum label spanning tree problem with bounded color classes , 2003, Oper. Res. Lett..

[17]  Gerhard J. Woeginger,et al.  Paths and cycles in colored graphs , 2001, Australas. J Comb..

[18]  Marek Karpinski,et al.  On Some Tighter Inapproximability Results, Further Improvements , 1998, Electron. Colloquium Comput. Complex..

[19]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[20]  Dominique de Werra,et al.  Bicolored matchings in some classes of graphs , 2005, Electron. Notes Discret. Math..

[21]  P. Berman,et al.  On Some Tighter Inapproximability Results , 1998, Electron. Colloquium Comput. Complex..