Pages that link to "Item:Q1977645"
From MaRDI portal
The following pages link to On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645):
Displaying 16 items.
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
- An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes (Q908293) (← links)
- On shortest three-edge-connected Steiner networks with Euclidean distance (Q1570830) (← links)
- On the complexity of the Steiner problem (Q1583698) (← links)
- New pruning rules for the Steiner tree problem and 2-connected Steiner network problem (Q1631775) (← links)
- Bifurcations of binary types of Steiner minimal networks in the plane (Q2055330) (← links)
- Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434) (← links)
- Relay placement for two-connectivity (Q2339829) (← links)
- Bounding component sizes of two-connected Steiner networks (Q2380015) (← links)
- Two-connected Steiner networks: structural properties (Q2488236) (← links)
- On Steiner 2-edge connected polytopes (Q2816114) (← links)
- (Q3758867) (← links)
- On shortest two-connected Steiner networks with Euclidean distance (Q4540072) (← links)
- Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane (Q4628046) (← links)
- Fixed parameter tractability of a biconnected bottleneck Steiner network problem (Q6066052) (← links)
- The complexity landscape of disaster‐aware network extension problems (Q6196887) (← links)
