The following pages link to (Q3836515):
Displayed 13 items.
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- A distance approximating trees (Q948693) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Spanners and message distribution in networks. (Q1427197) (← links)
- The non-approximability of bicriteria network design problems (Q1827279) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Network flow spanners (Q3057178) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)