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

06/24/2020
by   Haitao Wang, 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 so that the radius of the resulting graph is minimized, where any center is constrained to be one of the vertices of P. Previously, the "continuous" version of the problem where a center may be a point in the interior of an edge of the graph was studied and a linear-time algorithm was known. Our "discrete" version of the problem has not been studied before. We present a linear-time algorithm for the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2019

A Linear-Time Algorithm for 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
03/17/2023

The geodesic edge center of a simple polygon

The geodesic edge center of a polygon is a point c inside the polygon th...
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
04/10/2019

Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm

Time Optimal Path Parametrization is the problem of minimizing the time ...
research
08/04/2020

Automorphism groups of maps in linear time

By a map we mean a 2-cell decomposition of a closed compact surface, i.e...
research
08/04/2023

Comments on "A Linear Time Algorithm for the Optimal Discrete IRS Beamforming"

Comments on [1] are provided. Updated necessary and sufficient condition...
research
06/25/2020

A linear time algorithm for constructing orthogonal floor plans with minimum number of bends

Let G = (V, E) be a planar triangulated graph (PTG) having every face tr...

Please sign up or login with your details

Forgot password? Click here to reset