TY - JOUR AB - © 2014, Springer Science+Business Media New York. 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$$4-approximation algorithm for the problem. AU - Frati, F AU - Gaspers, S AU - Gudmundsson, J AU - Mathieson, L DA - 2015/08/19 DO - 10.1007/s00453-014-9886-4 EP - 1010 JO - Algorithmica PY - 2015/08/19 SP - 995 TI - Augmenting Graphs to Minimize the Diameter VL - 72 Y1 - 2015/08/19 Y2 - 2024/03/28 ER -