Complexity and algorithms for constant diameter augmentation problems

Eun Jung Kim (1) , Martin Milanic , Jérôme Monnot , Christophe Picouleau (2)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 CEDRIC - OC - CEDRIC. Optimisation Combinatoire

We study the following problem: for given integers $d,k$ and graph $G$, can we obtain a graph with diameter $d$ via at most $k$ edge deletions ? We determine the computational complexity of this and related problems for different values of $d$.

Domaines: Informatique [cs]; Mathématiques [math]

Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau. Complexity and algorithms for constant diameter augmentation problems. Theoretical Computer Science, 2022, 904, pp.15-26. ⟨10.1016/j.tcs.2021.05.020⟩. ⟨hal-03107522⟩