Pages that link to "Item:Q5471085"
From MaRDI portal
The following pages link to Approximation algorithms for somek-source shortest paths spanning tree problems (Q5471085):
Displaying 13 items.
- On the \(K\) shortest path trees problem (Q1040982) (← links)
- The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818) (← links)
- An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem (Q1664248) (← links)
- An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- (Q3197844) (← links)
- (Q4537738) (← links)
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees (Q4805401) (← links)
- (Q5075270) (← links)
- Algorithms – ESA 2004 (Q5464597) (← links)
- Approximation algorithms for the k-source multicast tree construction problem (Q5471088) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901295) (← links)
