Year: 2016
Type: preprint
Abstract: Let $P$ be a path graph of $n$ vertices embedded in a metric space. We consider the problem of adding a new edge to $P$ such that the diameter of the resulting graph is minimized. Previously (in ICALP 2015) the problem was solved in $O(n\log^3 n)$ time. In this paper, based on new observations and different algorithmic techniques, we present an $O(n\log n)$ time algorithm.
Source: arXiv (Cornell University)
Author: Wang, Haitao
Institution: Utah State University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2952889316