Pages that link to "Item:Q3789369"
From MaRDI portal
The following pages link to Convexity and the Steiner tree problem (Q3789369):
Displaying 18 items.
- Opaque sets (Q517796) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- Shortest enclosing walks and cycles in embedded graphs (Q1116348) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
- On finding two-connected subgraphs in planar graphs (Q1376267) (← links)
- The Steiner tree problem for terminals on the boundary of a rectilinear polygon (Q1566725) (← links)
- On shortest three-edge-connected Steiner networks with Euclidean distance (Q1570830) (← links)
- On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
- Opaque Sets (Q3088094) (← links)
- Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in <i>R<sup>d</sup></i> (Q4291488) (← links)
- A rectilinear steiner minimal tree algorithm for convex point sets (Q5056104) (← links)
- A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets (Q6487979) (← links)
