Algorithms for radius-optimally augmenting trees in a metric space
From MaRDI portal
Publication:832891
DOI10.1007/978-3-030-83508-8_33OpenAlexW3189746444MaRDI QIDQ832891FDOQ832891
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_33
Cites Work
- Title not available (Why is that?)
- Diameter increase caused by edge deletion
- The parametric complexity of graph diameter augmentation
- Minimizing the Diameter of a Network Using Shortcut Edges
- Augmenting graphs to minimize the diameter
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Title not available (Why is that?)
- Minimizing the continuous diameter when augmenting a tree with a shortcut
- 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
- Title not available (Why is that?)
- 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
Cited In (6)
- Finding diameter-reducing shortcuts in trees
- Algorithms for improving the quality of \(R\)-trees
- Title not available (Why is that?)
- 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)
