Minimizing the continuous diameter when augmenting a tree with a shortcut

DOI10.1007/978-3-319-62127-2_26zbMath1491.68142OpenAlexW2963294239MaRDI QIDQ2405291

Jean-Lou De Carufel, Carsten Grimm, Michiel H. M. Smid, Stefan Schirra

Publication date: 22 September 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62127-2_26

zbMATH Keywords

network augmentationcontinuous diameter minimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Algorithms for radius-optimally augmenting trees in a metric space, Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees, Algorithms for radius-optimally augmenting trees in a metric space, Computing optimal shortcuts for networks, An improved algorithm for diameter-optimally augmenting paths in a metric space, Unnamed Item, Unnamed Item, A linear-time algorithm for radius-optimally augmenting paths in a metric space, Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees, Shortcut sets for the locus of plane Euclidean networks, A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space, Augmenting Geometric Graphs with Matchings, Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees