Pages that link to "Item:Q491161"

The following pages link to On the hardness of full Steiner tree problems (Q491161):

Displaying 9 items.

• The full Steiner tree problem (Q702772) (← links)
• Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
• The internal Steiner tree problem: Hardness and approximations (Q1931427) (← links)
• The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
• Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
• A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
• On full Steiner trees in unit disk graphs (Q2349739) (← links)
• THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
• (Q3731620) (← links)