Pages that link to "Item:Q664543"

The following pages link to Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543):

Displaying 8 items.

• Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
• An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
• \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
• Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs (Q3588402) (← links)
• Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces (Q3597878) (← links)
• FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees (Q5075834) (← links)
• (Q6062162) (← links)
• Bounded-diameter tree-decompositions (Q6548028) (← links)