A linear-time algorithm for radius-optimally augmenting paths in a metric space

DOI10.1007/978-3-030-24766-9_34OpenAlexW2966835187MaRDI QIDQ5919319

No author found.

Publication date: 16 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.12061

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (6)

Algorithms for radius-optimally augmenting trees in a metric space ⋮ Augmenting graphs to minimize the radius ⋮ Algorithms for radius-optimally augmenting trees in a metric space ⋮ Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees ⋮ A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space ⋮ Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees

This page was built for publication: A linear-time algorithm for radius-optimally augmenting paths in a metric space