Almost optimal algorithms for diameter-optimally augmenting trees
From MaRDI portal
Publication:2167895
DOI10.1016/j.tcs.2022.07.028OpenAlexW2951212506MaRDI QIDQ2167895
Publication date: 1 September 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.08822
Related Items (1)
Cites Work
- Unnamed Item
- Augmenting graphs to minimize the diameter
- Finding the upper envelope of n line segments in O(n log n) time
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Algorithms for radius-optimally augmenting trees in a metric space
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Augmenting trees to meet biconnectivity and diameter constraints
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
- The parametric complexity of graph diameter augmentation
- Augmenting Outerplanar Graphs to Meet Diameter Requirements
- Minimizing the Diameter of a Network Using Shortcut Edges
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Diameter increase caused by edge deletion
- Decreasing the diameter of bounded degree graphs
- A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
- Diameter bounds for altered graphs
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
- An improved algorithm for diameter-optimally augmenting paths in a metric space
- A linear-time algorithm for 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: Almost optimal algorithms for diameter-optimally augmenting trees
