On the complexity of Minimum colored Maximum Matching - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Preprints, Working Papers, ... Year : 2019

On the complexity of Minimum colored Maximum Matching

Abstract

We deal with three aspects of the complexity of the problem of finding a maximum matching that minimizes the number of colors in a vertex-colored graph. We first prove that it is W[2]-hard, next that it is hard to approximate in a similar way as the Set Cover problem, and finally that it is fixed-parameter tractable for a suitable (yet meaningful) choice of parameter.
Fichier principal
Vignette du fichier
MCMM.pdf (231.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02157745 , version 1 (17-06-2019)

Licence

Attribution - NonCommercial - ShareAlike

Identifiers

  • HAL Id : hal-02157745 , version 1

Cite

Johanne Cohen, Yannis Manoussakis, Jonas Sénizergues. On the complexity of Minimum colored Maximum Matching. 2019. ⟨hal-02157745⟩
70 View
188 Download

Share

Gmail Facebook X LinkedIn More