Algorithms for radius-optimally augmenting trees in a metric space

DOI10.1007/978-3-030-83508-8_33MaRDI QIDQ832891zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 6792403 (Why is no real title available?)
• A linear-time algorithm for discrete radius optimally augmenting paths in a metric space
• A linear-time algorithm for radius-optimally augmenting paths in a metric space
• A near-optimal algorithm for finding an optimal shortcut of a tree
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
• Almost optimal algorithms for diameter-optimally augmenting trees
• Diameter increase caused by edge deletion
• Fast algorithms for diameter-optimally augmenting paths and trees
• Improved approximability and non-approximability results for graph diameter decreasing problems
• Minimizing the continuous diameter when augmenting a tree with a shortcut
• Minimizing the diameter of a network using shortcut edges
• The parametric complexity of graph diameter augmentation

Cited in

(6)

• Finding diameter-reducing shortcuts in trees
• Algorithms for improving the quality of \(R\)-trees
• scientific article; zbMATH DE number 7205039 (Why is no real title available?)
• Almost optimal algorithms for diameter-optimally augmenting trees
• LP-relaxations for tree augmentation
• A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

This page was built for publication: Algorithms for radius-optimally augmenting trees in a metric space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832891)