Pages that link to "Item:Q476426"
From MaRDI portal
The following pages link to Finding best swap edges minimizing the routing cost of a spanning tree (Q476426):
Displaying 7 items.
- Linear time distributed swap edge algorithms (Q783711) (← links)
- A faster computation of all the best swap edges of a shortest paths tree (Q893317) (← links)
- An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners (Q5090997) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
