Augmenting Graphs to Minimize the Diameter
- Publication Type:
- Journal Article
- Algorithmica, 2015, 72 (4), pp. 995 - 1010
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 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.
Please use this identifier to cite or link to this item: