Algorithms for radius-optimally augmenting trees in a metric space
type: Item
instance of: scholarly article
title: Algorithms for radius-optimally augmenting trees in a metric space
DOI: 10.1007/978-3-030-83508-8_33
author: Joachim Gudmundsson
author: Yuan Sha
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7498696
MaRDI profile type: Publication
full work available at URL: 978-3-030-83508-8 33
OpenAlex ID: W3189746444
cites work: Q4508365
cites work: Q5091032
cites work: Improved approximability and non-approximability results for graph diameter decreasing problems
cites work: Q5369529
cites work: Minimizing the continuous diameter when augmenting a tree with a shortcut
cites work: Minimizing the Diameter of a Network Using Shortcut Edges
cites work: Augmenting graphs to minimize the diameter
cites work: The parametric complexity of graph diameter augmentation
cites work: Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
cites work: A linear-time algorithm for radius-optimally augmenting paths in a metric space
cites work: A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
cites work: Diameter increase caused by edge deletion
cites work: An improved algorithm for diameter-optimally augmenting paths in a metric space
cites work: Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
cites work: A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
description: scientific article; zbMATH DE number 7498696