A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space

04/26/2019
by   Christopher Johnson, et al.
0

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 to minimize the radius of the resulting graph. Previously, a similar problem for minimizing the diameter of the graph was solved in O(nlog n) time. To the best of our knowledge, the problem of minimizing the radius has not been studied before. In this paper, we present an O(n) time algorithm for the problem, which is optimal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2020

A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space

Let P be a path graph of n vertices embedded in a metric space. We consi...
research
04/10/2019

Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm

Time Optimal Path Parametrization is the problem of minimizing the time ...
research
09/24/2018

Almost optimal algorithms for diameter-optimally augmenting trees

We consider the problem of augmenting an n-vertex tree with one shortcu...
research
07/19/2016

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees

We consider the problem of augmenting an n-vertex graph embedded in a me...
research
02/16/2021

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

A graph is Helly if every family of pairwise intersecting balls has a no...
research
08/07/2022

The 2-center Problem in Maximal Outerplanar Graph

We consider the problem of computing 2-center in maximal outerplanar gra...
research
12/15/2017

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain

We study the computation of the diameter and radius under the rectilinea...

Please sign up or login with your details

Forgot password? Click here to reset