scientific article; zbMATH DE number 6792403

DOI10.4230/LIPICS.SWAT.2016.27MaRDI QIDQ5369529zbMATH OpenFDO

Authors Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel Smid

Publication date 17 October 2017

Full work available at URL https://arxiv.org/abs/1512.02257

zbMATH Keywords

pathsshortcutsdiametercyclesnetwork augmentation

Mathematics Subject Classification ID

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

Recommendations

• Minimizing the continuous diameter when augmenting a tree with a shortcut
• Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
• Dilation-optimal edge deletion in polygonal cycles
• Dilation-Optimal Edge Deletion in Polygonal Cycles
• Minimizing the sum of diameters efficiently
• Minimizing the diameter of a network using shortcut edges
• Decreasing the diameter of cycles
• Fast algorithms for diameter-optimally augmenting paths

Cited in

(22)

• Minimizing the diameter of a network using shortcut edges
• Algorithms for radius-optimally augmenting trees in a metric space
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
• Algorithms for radius-optimally augmenting trees in a metric space
• Computing optimal shortcuts for networks
• scientific article; zbMATH DE number 7561369 (Why is no real title available?)
• Shortcut sets for the locus of plane Euclidean networks
• Fast algorithms for diameter-optimally augmenting paths and trees
• A linear-time algorithm for radius-optimally augmenting paths in a metric space
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
• A linear-time algorithm for discrete radius optimally augmenting paths in a metric space
• Almost optimal algorithms for diameter-optimally augmenting trees
• Finding diameter-reducing shortcuts in trees
• Minimizing the continuous diameter when augmenting a tree with a shortcut
• Shortest paths in the plane with obstacle violations
• Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
• Shortest paths in the plane with obstacle violations
• Almost optimal algorithms for diameter-optimally augmenting trees
• Shortcut sets for plane Euclidean networks (extended abstract)
• Shortcuts for the circle
• Shortcuts for the circle
• Geometric path problems with violations

This page was built for publication:

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