Pages that link to "Item:Q2237889"
From MaRDI portal
The following pages link to An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889):
Displaying 5 items.
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Reliability assessment of the divide-and-swap cube in terms of generalized connectivity (Q2680983) (← links)
- (Q2934603) (← links)