The labeled maximum matching problem

Authors:
Francesco Carrabs;Raffaele Cerulli;Monica Gentili
Affiliations:
Department of Mathematics and Computer Science, University of Salerno, Via Ponte Don Melillo, 84084 Fisciano (SA), Italy;Department of Mathematics and Computer Science, University of Salerno, Via Ponte Don Melillo, 84084 Fisciano (SA), Italy;Department of Mathematics and Computer Science, University of Salerno, Via Ponte Don Melillo, 84084 Fisciano (SA), Italy
Venue:
Computers and Operations Research
Year:
2009

Citing 11
Cited 2

The minimum labeling spanning trees

Information Processing Letters
On the minimum label spanning tree problem

Information Processing Letters
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on 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
Introduction to Algorithms

Introduction to Algorithms
A note on the minimum label spanning tree

Information Processing Letters
The labeled perfect matching in bipartite graphs

Information Processing Letters
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
On complexity and approximability of the labeled maximum/perfect matching problems

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A one-parameter genetic algorithm for the minimum labeling spanning tree problem

IEEE Transactions on Evolutionary Computation
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

Operations Research Letters

Constrained matching problems in bipartite graphs

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Comparison of heuristics for the colourful travelling salesman problem

International Journal of Metaheuristics

Quantified Score

Hi-index	0.01

Visualization

Abstract

Given a graph G where a label is associated with each edge, we address the problem of looking for a maximum matching of G using the minimum number of different labels, namely the labeled maximum matching problem. It is a relatively new problem whose application is related to the timetabling problem. We prove it is NP-complete and present four different mathematical formulations. Moreover, we propose an exact algorithm based on a branch-and-bound approach to solve it. We evaluate the performance of our algorithm on a wide set of instances and compare our computational times with the ones required by CPLEX to solve the proposed mathematical formulations. Test results show the effectiveness of our procedure, that hugely outperforms the solver.