Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2017

Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts

Résumé

Total dominating set, connected vertex cover and Steiner tree are well-known graph problems. Despite the fact that they are NP-complete to optimize, it is easy (even trivial) to find solutions, regardless of their size. In this paper, we study a variant of these problems by adding conflicts, that are pairs of vertices that cannot be both in a solution. This new constraint leads to situations where it is NP-complete to decide if there exists a solution avoiding conflicts. This paper proposes NP-completeness proofs of the existence of a solution for different restricted classes of graphs and conflicts, improving recent results. We also propose polynomial time constructions in several restricted cases and we introduce a new parameter, the stretch, to capture the locality of the conflicts.

Mots clés

Fichier principal
Vignette du fichier
Problems with Conflicts.pdf (423.91 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01455072 , version 1 (03-02-2017)
hal-01455072 , version 2 (13-09-2017)
hal-01455072 , version 3 (19-12-2017)

Identifiants

  • HAL Id : hal-01455072 , version 2

Citer

Alexis Cornet, Christian Laforest. Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts. [Research Report] LIMOS (UMR CNRS 6158), université Clermont Auvergne, France. 2017. ⟨hal-01455072v2⟩

Collections

LARA
297 Consultations
1404 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More