Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
Abstract
We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a path, running in O(n 3 n) time, and (ii) the input graph is a tree, running in O(n2 n) time. We also present an algorithm that computes a (1+)-approximation in O(n + 1/3) time, for paths in Rd, where d is a constant.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.