Pages that link to "Item:Q1199447"
From MaRDI portal
The following pages link to Heuristics for the Steiner problem in graphs (Q1199447):
Displaying 11 items.
- A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030) (← links)
- Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
- Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
- Generalized spanning trees (Q1579496) (← links)
- A heuristic for the Steiner problem in graphs (Q1918915) (← links)
- Dual heuristics on the exact solution of large Steiner problems (Q2741494) (← links)
- (Q3974150) (← links)
- Worst-case relative performances of heuristics for the Steiner problem in graphs (Q3988522) (← links)
- Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks (Q6496368) (← links)