1 research outputs found
Augmenting graphs to minimize the diameter
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.Comment: 15 pages, 3 figure