Pages that link to "Item:Q2380015"
From MaRDI portal
The following pages link to Bounding component sizes of two-connected Steiner networks (Q2380015):
Displayed 5 items.
- New pruning rules for the Steiner tree problem and 2-connected Steiner network problem (Q1631775) (← links)
- Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434) (← links)
- Relay placement for two-connectivity (Q2339829) (← 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)