Pages that link to "Item:Q1178221"
From MaRDI portal
The following pages link to A note on ''A faster approximation algorithm for the Steiner problem in graphs'' (Q1178221):
Displaying 6 items.
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- (Q3137223) (← links)
- (Q4027204) (← links)
- (Q4038157) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)