Hostname: page-component-76fb5796d-dfsvx Total loading time: 0 Render date: 2024-04-27T20:00:37.808Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on the hardness results for the labeledperfect matching problems in bipartite graphs

Published online by Cambridge University Press:  20 August 2008

Jérôme Monnot
Jérôme Monnot*
Affiliation:
CNRS LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, 75775 Paris Cedex 16, France; monnot@lamsade.dauphine.fr
Get access

Abstract

In this note, we strengthen the inapproximation bound of O(logn) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters96 (2005) 81–88, using a self improving operation in some hard instances. It is interesting to note that this self improving operation does not work for all instances. Moreover, based on this approach we deduce that the problem does not admit constant approximation algorithms for connected planar cubic bipartite graphs.

Keywords

Labeled matchingbipartite graphsapproximation and complexityinapproximation bounds.
Type
Research Article
Information
RAIRO - Operations Research , Volume 42 , Issue 3 , July 2008 , pp. 315 - 324
Copyright
© EDP Sciences, ROADEF, SMAI, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

P. Alimonti and V. Kann, Hardness of approximating problems on cubic graphs, in Proc. CIAC'97, Lect. Notes Comput. Sci. 1203 (1997) 288–298.
Arora, S. and Sudan, M., Improved low-degree testing and its applications. Combinatorica 23 (2003) 365–426. CrossRef
Cameron, K., Coloured matchings in bipartite graphs. Discrete Math. 169 (1997) 205–209. CrossRef
Costa, M., de Werra, D., Picouleau, C. and Ries, B., Bicolored matchings in some classes of graphs. Graphs Comb. 23 (2007) 47–60. CrossRef
Itai, A., Rodeh, M. and Tanimoto, S., Some matching problems in bipartite graphs. J. ACM 25 (1978) 517–525. CrossRef
J. Monnot, On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems, in Proc. ISAAC'05, Lect. Notes Comput. Sci. 3827 (2005) 934–943.
Monnot, J., The Labeled perfect matching in bipartite graphs. Inf. Proc. Lett. 96 (2005) 81–88. CrossRef
A. Paz and S. Moran, Non deterministic polynomial optimisation problems and their approximation, Theor. Comput. Sci. 95 (1981) 251–277.
Richey, M.B. and Punnen, A.P., Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization. Discrete Appl. Math. 39 (1992) 147–153. CrossRef