scientific article; zbMATH DE number 6792403
From MaRDI portal
Publication:5369529
DOI10.4230/LIPICS.SWAT.2016.27zbMATH Open1378.68169arXiv1512.02257MaRDI QIDQ5369529FDOQ5369529
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
Title of this publication is not available (Why is that?)
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
- Augmenting graphs to minimize the diameter
- Augmenting graphs to minimize the diameter
- Decreasing the diameter of cycles
- Fast algorithms for diameter-optimally augmenting paths
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (23)
- Minimizing the diameter of a network using shortcut edges
- An improved algorithm for diameter-optimally augmenting paths in a metric space
- Algorithms for radius-optimally augmenting trees in a metric space
- Algorithms for radius-optimally augmenting trees in a metric space
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing optimal shortcuts for networks
- Shortcut sets for the locus of plane Euclidean networks
- A linear-time algorithm for radius-optimally augmenting paths in a metric space
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
- Finding diameter-reducing shortcuts in trees
- Minimizing the continuous diameter when augmenting a tree with a shortcut
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
- Shortest paths in the plane with obstacle violations
- Title not available (Why is that?)
- Almost optimal algorithms for diameter-optimally augmenting trees
- Shortcut sets for plane Euclidean networks (extended abstract)
- A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
- Shortcuts for the circle
- Title not available (Why is that?)
- Geometric path problems with violations
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
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)
