Pages that link to "Item:Q1931427"
From MaRDI portal
The following pages link to The internal Steiner tree problem: Hardness and approximations (Q1931427):
Displayed 6 items.
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Reliability assessment of the divide-and-swap cube in terms of generalized connectivity (Q2680983) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)