Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
From MaRDI portal
Publication:3597878
Recommendations
- On optimal embeddings of metrics in graphs
- Approximating Shortest Paths in Graphs
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
- Faster shortest paths in dense distance graphs, with applications
- On computational complexity of length embeddability of graphs
- Computing almost shortest paths (extended abstract)
- Embedding planar graphs into low-treewidth graphs with applications to efficient approximation schemes for metric problems
- Shortest path computations in source-deplanarized graphs
- Improved bounds for shortest paths in dense distance graphs
Cited in
(13)- Computing the dilation of edge-augmented graphs in metric spaces
- Computing optimal shortcuts for networks
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
- Shortcut sets for the locus of plane Euclidean networks
- Fast algorithms for diameter-optimally augmenting paths
- Impact of the topology of urban streets on mobility optimization
- Fast algorithms for diameter-optimally augmenting paths and trees
- Algorithms and Computation
- Improving the Dilation of a Metric Graph by Adding Edges
- Improving the dilation of a metric graph by adding edges
- Bicriteria approximation for minimum dilation graph augmentation
- Multivariate exploration of metric dilation
- On the dilation spectrum of paths, cycles, and trees
This page was built for publication: Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597878)
