Extension and its price for the connected vertex cover problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Extension and its price for the connected vertex cover problem

Résumé

We consider extension variants of Vertex Cover and Independent Set, following a line of research initiated in [9]. In particular , we study the Ext-CVC and the Ext-NSIS problems: given a graph G = (V, E) and a vertex set U ⊆ V , does there exist a minimal connected vertex cover (respectively, a maximal non-separating independent set) S, such that U ⊆ S (respectively, U ⊇ S). We present hardness results for both problems, for certain graph classes such as bipartite, chordal and weakly chordal. To this end we exploit the relation of Ext-CVC to Ext-VC, that is, to the extension variant of Vertex Cover. We also study the Price of Extension (PoE), a measure that reflects the distance of a vertex set U to its maximum efficiently computable subset that is ex-tensible to a minimal connected vertex cover, and provide negative and positive results for PoE in general and special graphs.
Fichier principal
Vignette du fichier
IWOCA19-ExtCVC.pdf (352.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02344051 , version 1 (03-11-2019)

Identifiants

Citer

Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris T. Pagourtzis. Extension and its price for the connected vertex cover problem. Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings, Jul 2019, Pisa, Italy. ⟨10.1007/978-3-030-25005-8⟩. ⟨hal-02344051⟩
56 Consultations
474 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More