Pages that link to "Item:Q5469129"

The following pages link to Lower bounds for the relative greedy algorithm for approximating Steiner trees (Q5469129):

Displaying 2 items.

• A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
• The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)