Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ISAAC
2005
Springer

favoriteEmaildiscussreport

127views Algorithms» more ISAAC 2005»

On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems

13 years 10 months ago

On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems

Download www.lamsade.dauphine.fr

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 ﬁnding a maximum matching on G that uses a minimum or a maximum number of colors.

Jérôme Monnot

Real-time Traffic

ISAAC 2005 | Matching Problem | Maximum Matching | Perfect Matching Problem |

claim paper

Related Content

» The Complexity of Bottleneck Labeled Graph Problems

» Labeled Traveling Salesman Problems Complexity and approximation

» The Sketching Complexity of Pattern Matching

» Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with ...

» Approximation and Hardness Results for Label Cut and Related Problems

» Path following algorithm for the graph matching problem

» Multiclass pixel labeling with nonlocal matching constraints

» Approximate Labeling via Graph Cuts Based on Linear Programming

» The Complexity of Rationalizing Matchings

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ISAAC
Authors	Jérôme Monnot

Comments (0)