The labeled perfect matching in bipartite graphs
type: Item
instance of: scholarly article
title: The labeled perfect matching in bipartite graphs
zbMATH Open document ID: 1191.68470
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
full work available at URL: https://basepub.dauphine.fr/handle/123456789/2949
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5650135
zbMATH Keywords: labeled matching
zbMATH Keywords: bipartite graphs
zbMATH Keywords: NP-complete
zbMATH Keywords: approximate algorithms
author: Jérôme Monnot
MaRDI profile type: Publication
OpenAlex ID: W2090200648
cites work: Some APX-completeness results for cubic graphs
cites work: Improved approximation algorithms for MAX SAT
cites work: Spanning trees with many or few colors in edge-colored graphs
cites work: Q4659605
cites work: Local search for the minimum label spanning tree problem with bounded color classes.
cites work: Coloured matchings in bipartite graphs
cites work: Q4952637
cites work: The minimum labeling spanning trees
cites work: Bicolored matchings in some classes of graphs
cites work: A threshold of ln n for approximating set cover
cites work: Q4198056
cites work: Some Matching Problems for Bipartite Graphs
cites work: On the minimum label spanning tree problem
cites work: On approximation algorithms for the minimum satisfiability problem
cites work: Optimization, approximation, and complexity classes
cites work: Q4527015
cites work: A note on the minimum label spanning tree.
cites work: Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
cites work: Matchings in colored bipartite networks
DOI: 10.1016/J.IPL.2005.06.009
description: scientific article; zbMATH DE number 5650135