Pages that link to "Item:Q1763146"
From MaRDI portal
The following pages link to Approximation algorithms for quickest spanning tree problems (Q1763146):
Displaying 8 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- Approximation algorithms for some optimum communication spanning tree problems (Q1566575) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (Q3587419) (← links)
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (Q4210144) (← links)
- Algorithms – ESA 2004 (Q5464597) (← links)
- Approximation algorithms for somek-source shortest paths spanning tree problems (Q5471085) (← links)