Bicriteria approximation for minimum dilation graph augmentation
From MaRDI portal
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time algorithm for discrete radius 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
- Algorithms for radius-optimally augmenting trees in a metric space
- Almost optimal algorithms for diameter-optimally augmenting trees
- An improved algorithm for diameter-optimally augmenting paths in a metric space
- Approximate distance oracles
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
- Approximation algorithms for embedding general metrics into trees
- Augmenting graphs to minimize the diameter
- Computing a minimum-dilation spanning tree is NP-hard
- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
- Computing minimum dilation spanning trees in geometric graphs
- Computing the dilation of edge-augmented graphs in metric spaces
- Fast algorithms for diameter-optimally augmenting paths and trees
- Geometric Spanner Networks
- Graph spanners: a tutorial review
- scientific article; zbMATH DE number 1929927 (Why is no real title available?)
- scientific article; zbMATH DE number 2123255 (Why is no real title available?)
- scientific article; zbMATH DE number 1424297 (Why is no real title available?)
- scientific article; zbMATH DE number 7788618 (Why is no real title available?)
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Improving the Dilation of a Metric Graph by Adding Edges
- Improving the Stretch Factor of a Geometric Network by Edge Augmentation
- Minimizing the diameter of a network using shortcut edges
- Minimum dilation stars
- On some extremal problems in graph theory
- On sparse spanners of weighted graphs
- On the Parameterized Complexity of Approximating Dominating Set
- Optimality computation of the minimum stretch spanning tree problem
- Spanners of bounded degree graphs
- Sparse geometric graphs with small dilation
- The greedy spanner is existentially optimal
- Tree Spanners
- Tree spanners in planar graphs
- Truly optimal Euclidean spanners
This page was built for publication: Bicriteria approximation for minimum dilation graph augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253092)
