Augmenting graphs to minimize the diameter
arXiv:1309.5172
Abstract
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.
15 pages, 3 figures