Pages that link to "Item:Q3614156"
From MaRDI portal
The following pages link to Improving the Stretch Factor of a Geometric Network by Edge Augmentation (Q3614156):
Displaying 14 items.
- Shortcut sets for plane Euclidean networks (extended abstract) (Q510569) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Computing the dilation of edge-augmented graphs in metric spaces (Q1037772) (← links)
- Geometric path problems with violations (Q1709576) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut (Q2206728) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- (Q5111738) (← links)
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION (Q5300011) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
