The labeled perfect matching in bipartite graphs

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

Citing 14
Cited 8

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
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

Operations Research Letters

On a Labeled Vehicle Routing Problem

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
The complexity of bottleneck labeled graph problems

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The parameterized complexity of some minimum label problems

Journal of Computer and System Sciences
Approximation and hardness results for label cut and related problems

Journal of Combinatorial Optimization
Approximating minimum label s-t cut via linear programming

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Labeled Traveling Salesman Problems: Complexity and approximation

Discrete Optimization
Constrained matching problems in bipartite graphs

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A note on the Clustered Set Covering Problem

Discrete Applied Mathematics

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