Pages that link to "Item:Q5753759"
From MaRDI portal
The following pages link to A lower bound for the steiner tree problem in directed graphs (Q5753759):
Displaying 8 items.
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- A constrained Steiner tree problem (Q1129916) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- (Q5708491) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
