Pages that link to "Item:Q1313772"
From MaRDI portal
The following pages link to Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772):
Displaying 9 items.
- A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM (Q3021994) (← links)
- Worst-case relative performances of heuristics for the Steiner problem in graphs (Q3988522) (← links)
- (Q5708491) (← links)
- A note on distributed multicast routing in point-to-point networks (Q5945321) (← links)