Augmenting graphs to minimize the diameter
- Publication Type:
- Journal Article
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 8283 LNCS pp. 383 - 393
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
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. © 2013 Springer-Verlag.
Please use this identifier to cite or link to this item: