Augmenting graphs to minimize the diameter
classification
💻 cs.DS
keywords
augmentingdiametergraphproblemalgorithmapproximationaugmentedbounded
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.