Pages that link to "Item:Q5891382"
From MaRDI portal
The following pages link to Steiner forest orientation problems (Q5891382):
Displaying 12 items.
- Path-driven orientation of mixed graphs (Q479025) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- A tight lower bound for Steiner orientation (Q1625142) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
- Colored Non-crossing Euclidean Steiner Forest (Q3459881) (← links)
- Euclidean Prize-Collecting Steiner Forest (Q3557044) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- Steiner forest orientation problems (Q5891382) (← links)
- (Q5891764) (redirect page) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)