On the approximation hardness of geodetic set and its variants - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

On the approximation hardness of geodetic set and its variants

Résumé

Given a graph, a geodetic set (resp. edge geodetic set) is a subset of vertices such that every vertex (resp. edge) of the graph is on a shortest path between two vertices of the subset. A strong geodetic set is a subset S of vertices and a choice of a shortest path for every pair of vertices of S such that every vertex is on one of these shortest paths. The geodetic number (resp. edge geodetic number) of a graph is the minimum size of a geodetic set (resp. edge geodetic set) and the strong geodetic number is the minimum size of a strong geodetic set. We first prove that, given a subset of vertices, it is N P-hard to determine whether it is a strong geodesic set. Therefore, it seems natural to study the problem of maximizing the number of covered vertices by a choice of a shortest path for every pair of a provided subset of vertices. We provide a tight 2approximation algorithm to solve this problem. Then, we show that there is no 781 /780 polynomial-time approximation algorithm for edge geodetic number and strong geodetic number on subcubic bipartite graphs with arbitrarily high girth. We also prove that geodetic number and edge geodetic number are both LOG-APX-hard, even on subcubic bipartite graphs with arbitrarily high girth. Finally, we disprove a conjecture of Iršič and Konvalinka by proving that the strong geodetic number can be computed in polynomial time in complete multipartite graphs.
Fichier principal
Vignette du fichier
main.pdf (412.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

lirmm-03328636 , version 1 (30-08-2021)
lirmm-03328636 , version 2 (24-11-2021)

Identifiants

Citer

Tom Davot, Lucas Isenmann, Jocelyn Thiebaut. On the approximation hardness of geodetic set and its variants. COCOON 2021 - 27th International Computing and Combinatorics Conference, Oct 2021, Tainan, Taiwan. pp.76-88, ⟨10.1007/978-3-030-89543-3_7⟩. ⟨lirmm-03328636v2⟩
243 Consultations
224 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More