Pages that link to "Item:Q1179749"
From MaRDI portal
The following pages link to Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749):
Displaying 10 items.
- Generalized Steiner problem in outerplanar networks (Q1074505) (← links)
- Steiner problem in Halin networks (Q1092013) (← 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)
- On the complexity of the Steiner problem (Q1583698) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Exact solutions for the Steiner path cover problem on special graph classes (Q2050271) (← links)
- A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves (Q4242784) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)