The labeled perfect matching in bipartite graphs

Authors:
Jérôme Monnot
Affiliations:
Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, Paris Cedex, France
Venue:
Information Processing Letters
Year:
2005

Citing 16
Cited 1

On approximation algorithms for the minimum satisfiability problem

Information Processing Letters
Coloured matchings in bipartite graphs

Discrete Mathematics
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The minimum labeling spanning trees

Information Processing Letters
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
On the minimum label spanning tree problem

Information Processing Letters
Some Matching Problems for Bipartite Graphs

Journal of the ACM (JACM)
On the red-blue set cover problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Some APX-completeness results for cubic graphs

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A note on the minimum label spanning tree

Information Processing Letters
Improved approximation algorithms for MAX SAT

Journal of Algorithms
Matchings in colored bipartite networks

Discrete Applied Mathematics
On Some Tighter Inapproximability Results, Further Improvements

On Some Tighter Inapproximability Results, Further Improvements
Local search for the minimum label spanning tree problem with bounded color classes

Operations Research Letters
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

Operations Research Letters

The labeled maximum matching problem

Computers and Operations Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 → {C1, ... Cq}, the labeled perfect matching problem consists in finding a perfect matching on G that uses a minimum or a maximum number of colors.