eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-11-30
45:1
45:20
10.4230/LIPIcs.ISAAC.2021.45
article
Augmenting Graphs to Minimize the Radius
Gudmundsson, Joachim
1
Sha, Yuan
1
Yao, Fan
1
The University of Sydney, Australia
We study the problem of augmenting a metric graph by adding k edges while minimizing the radius of the augmented graph. We give a simple 3-approximation algorithm and show that there is no polynomial-time (5/3-ε)-approximation algorithm, for any ε > 0, unless P = NP.
We also give two exact algorithms for the special case when the input graph is a tree, one of which is generalized to handle metric graphs with bounded treewidth.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.45/LIPIcs.ISAAC.2021.45.pdf
graph augmentation
radius
approximation algorithm