Algorithms for radius-optimally augmenting trees in a metric space

DOI10.1007/978-3-030-83508-8_33OpenAlexW3189746444MaRDI QIDQ832891

Joachim Gudmundsson, Yuan Sha

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_33

Mathematics Subject Classification ID

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

Related Items

Almost optimal algorithms for diameter-optimally augmenting trees, Finding diameter-reducing shortcuts in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Augmenting graphs to minimize the diameter
• Improved approximability and non-approximability results for graph diameter decreasing problems
• Minimizing the continuous diameter when augmenting a tree with a shortcut
• The parametric complexity of graph diameter augmentation
• Minimizing the Diameter of a Network Using Shortcut Edges
• Diameter increase caused by edge deletion
• A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
• A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
• Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
• An improved algorithm for diameter-optimally augmenting paths in a metric space
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
• A linear-time algorithm for radius-optimally augmenting paths in a metric space