Pages that link to "Item:Q1116902"

The following pages link to An edge elimination test for the Steiner problem in graphs (Q1116902):

Displaying 10 items.

• Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
• Reducing the hierarchical network design problem (Q1121181) (← links)
• The multi-weighted Steiner tree problem (Q1179753) (← links)
• The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
• Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
• Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
• The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)