Augmenting graphs to minimize the diameter
Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson · arXiv (Cornell University) · 2013
We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT 4-approximation algorithm for the problem.