Authors
Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson
Publication date
2015/8
Journal
Algorithmica
Volume
72
Pages
995-1010
Publisher
Springer US
Description
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 -approximation algorithm for the problem.
Scholar articles
F Frati, S Gaspers, J Gudmundsson, L Mathieson - Algorithmica, 2015