Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
From MaRDI portal
Publication:2206728
DOI10.1016/j.comgeo.2020.101631zbMath1476.68201arXiv1612.01370OpenAlexW3008099931MaRDI QIDQ2206728
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid, Stefan Schirra
Publication date: 23 October 2020
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.01370
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Almost optimal algorithms for diameter-optimally augmenting trees ⋮ Finding diameter-reducing shortcuts in trees
Cites Work
- Unnamed Item
- Euclidean chains and their shortcuts
- Augmenting graphs to minimize the diameter
- Shortcut sets for plane Euclidean networks (extended abstract)
- Geometric applications of a matrix-searching algorithm
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Augmenting trees to meet biconnectivity and diameter constraints
- The parametric complexity of graph diameter augmentation
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Fast Algorithms for Diameter-Optimally Augmenting Paths
- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
- Improving the Stretch Factor of a Geometric Network by Edge Augmentation
- Diameter increase caused by edge deletion
- A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- An improved algorithm for diameter-optimally augmenting paths in a metric space
This page was built for publication: Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
