On complexity and approximability of the labeled maximum/perfect matching problems

Authors:
Jérôme Monnot
Affiliations:
CNRS, LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 17
Cited 2

Polychromatic Hamilton cycles

Discrete Mathematics
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
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
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

On Some Tighter Inapproximability Results
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
Constrained matching problems in bipartite graphs

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

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 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.